Concentration of Measure for the Analysis of Randomized Algo (Hardcover)
 
作者: Devdatt P Dubhashi 
分類: Mathematical theory of computation  
書城編號: 388877


售價: $1652.00

購買後立即進貨, 約需 18-25 天

 
 
出版社: Cambridge University Press
出版日期: 2009/06/15
尺寸: 237x165x24mm
重量: 437 grams
ISBN: 9780521884273

商品簡介
Randomized algorithms have become a central part of the algorithms curriculum based on their increasingly widespread use in modern applications. This book presents a coherent and unified treatment of probabilistic techniques for obtaining high- probability estimates on the performance of randomized algorithms. It covers the basic tool kit from the Chernoff-Hoeffding (CH) bounds to more sophisticated techniques like Martingales and isoperimetric inequalities, as well as some recent developments like Talagrand's inequality, transportation cost inequalities, and log-Sobolev inequalities. Along the way, variations on the basic theme are examined, such as CH bounds in dependent settings. The authors emphasize comparative study of the different methods, highlighting respective strengths and weaknesses in concrete example applications. The exposition is tailored to discrete settings sufficient for the analysis of algorithms, avoiding unnecessary measure-theoretic details, thus making the book accessible to computer scientists as well as probabilists and discrete mathematicians.
Devdatt P Dubhashi 作者作品表

Concentration of Measure for the Analysis of Randomized Algo (Paperback)

Concentration of Measure for the Analysis of Randomized Algo (Hardcover)

* 以上資料僅供參考之用, 香港書城並不保證以上資料的準確性及完整性。
* 如送貨地址在香港以外, 當書籍/產品入口時, 顧客須自行繳付入口關稅和其他入口銷售稅項。

 

 

 

  我的賬戶 |  購物車 |  出版社 |  團購優惠
加入供應商 |  廣告刊登 |  公司簡介 |  條款及細則

香港書城 版權所有 私隱政策聲明

顯示模式: 電腦版 (改為: 手機版)