Cargando…

Concentration of Measure for the Analysis of Randomized Algorithms.

A coherent and unified account of techniques for analyzing the performance of randomized algorithms.

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Dubhashi, Devdatt
Otros Autores: Panconesi, Alessandro
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Leiden : Cambridge University Press, 2009.
Temas:
Acceso en línea:Texto completo

MARC

LEADER 00000cam a2200000Mu 4500
001 EBOOKCENTRAL_ocn438728734
003 OCoLC
005 20240329122006.0
006 m o d
007 cr mn|---|||||
008 090914s2009 ne o 000 0 eng d
040 |a MERUC  |b eng  |e pn  |c MERUC  |d YDXCP  |d EBLCP  |d OCLCQ  |d MHW  |d OCLCQ  |d IDEBK  |d DEBSZ  |d OCLCQ  |d OCLCO  |d OCLCQ  |d OCLCF  |d OCLCQ  |d ZCU  |d OCLCQ  |d MERUC  |d U3W  |d ICG  |d INT  |d OCLCQ  |d DKC  |d AU@  |d OCLCQ  |d UKAHL  |d OCLCQ  |d OCLCO  |d OCL  |d OCLCQ  |d OCLCO  |d OCLCL 
019 |a 609842926 
020 |a 9780511580291  |q (electronic bk.) 
020 |a 0511580290  |q (electronic bk.) 
029 1 |a DEBBG  |b BV044137395 
029 1 |a DEBSZ  |b 379310783 
029 1 |a AU@  |b 000066764318 
029 1 |a DKDLA  |b 820120-katalog:999925482405765 
035 |a (OCoLC)438728734  |z (OCoLC)609842926 
050 4 |a QA273.D765 2009 
082 0 4 |a 518.1 
049 |a UAMI 
100 1 |a Dubhashi, Devdatt. 
245 1 0 |a Concentration of Measure for the Analysis of Randomized Algorithms. 
260 |a Leiden :  |b Cambridge University Press,  |c 2009. 
300 |a 1 online resource (214 pages) 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
505 0 |a Cover; Half-title; Title; Copyright; Dedication; Contents; Preface; 1 Chernoff-Hoeffding Bounds; 2 Applications of the Chernoff-Hoeffding Bounds; 3 Chernoff-Hoeffding Bounds in Dependent Settings; 4 Interlude: Probabilistic Recurrences; 5 Martingales and the Method of Bounded Differences; 6 The Simple Method of Bounded Differences in Action; 7 The Method of Averaged Bounded Differences; 8 The Method of Bounded Variances; 9 Interlude: The Infamous Upper Tail; 10 Isoperimetric Inequalities and Concentration; 11 Talagrand's Isoperimetric Inequality. 
505 8 |a 12 Isoperimetric Inequalities and Concentration via Transportation Cost Inequalities13 Quadratic Transportation Cost and Talagrand's Inequality; 14 Log-Sobolev Inequalities and Concentration; Appendix A Summary of the Most Useful Bounds; Bibliography; Index. 
520 |a A coherent and unified account of techniques for analyzing the performance of randomized algorithms. 
588 0 |a Print version record. 
590 |a ProQuest Ebook Central  |b Ebook Central Academic Complete 
650 0 |a Algorithms. 
650 0 |a Distribution (Probability theory) 
650 0 |a Limit theorems (Probability theory) 
650 0 |a Random variables. 
650 0 |a Computer algorithms. 
650 6 |a Algorithmes. 
650 6 |a Distribution (Théorie des probabilités) 
650 6 |a Théorèmes limites (Théorie des probabilités) 
650 6 |a Variables aléatoires. 
650 7 |a algorithms.  |2 aat 
650 7 |a distribution (statistics-related concept)  |2 aat 
650 7 |a Computer algorithms  |2 fast 
650 7 |a Algorithms  |2 fast 
650 7 |a Distribution (Probability theory)  |2 fast 
650 7 |a Limit theorems (Probability theory)  |2 fast 
650 7 |a Random variables  |2 fast 
700 1 |a Panconesi, Alessandro. 
758 |i has work:  |a Concentration of measure for the analysis of randomized algorithms (Text)  |1 https://id.oclc.org/worldcat/entity/E39PCGvdkRryhttv4bHvkT7Y6C  |4 https://id.oclc.org/worldcat/ontology/hasWork 
776 1 |z 9780521884273 
856 4 0 |u https://ebookcentral.uam.elogim.com/lib/uam-ebooks/detail.action?docID=451942  |z Texto completo 
938 |a Askews and Holts Library Services  |b ASKH  |n AH37560609 
938 |a Askews and Holts Library Services  |b ASKH  |n AH33124017 
938 |a EBL - Ebook Library  |b EBLB  |n EBL451942 
938 |a ProQuest MyiLibrary Digital eBook Collection  |b IDEB  |n 230277 
938 |a YBP Library Services  |b YANK  |n 3095173 
994 |a 92  |b IZTAP