Dekorationsartikel gehören nicht zum Leistungsumfang.
Concentration of Measure for the Analysis of Randomized Algorithms
Taschenbuch von Alessandro Panconesi
Sprache: Englisch

56,10 €*

inkl. MwSt.

Versandkostenfrei per Post / DHL

Lieferzeit 4-7 Werktage

Kategorien:
Beschreibung
This book presents a coherent and unified account of classical and more advanced techniques for analyzing the performance of randomized algorithms.
This book presents a coherent and unified account of classical and more advanced techniques for analyzing the performance of randomized algorithms.
Über den Autor
Devdatt P. Dubhashi is Professor in the Department of Computer Science and Engineering at Chalmers University, Sweden. He earned a Ph.D. in computer science from Cornell University and held positions at the Max-Planck-Institute for Computer Science in Saarbruecken, BRICS, the University of Aarhus and IIT Delhi. Dubhashi has published widely at international conferences and in journals, including many special issues dedicated to best contributions. His research interests span the range from combinatorics to probabilistic analysis of algorithms, and more recently, to computational systems biology and distributed information systems such as the Web.
Inhaltsverzeichnis
1. Chernoff¿Hoeffding bounds; 2. Applying the CH-bounds; 3. CH-bounds with dependencies; 4. Interlude: probabilistic recurrences; 5. Martingales and the MOBD; 6. The MOBD in action; 7. Averaged bounded difference; 8. The method of bounded variances; 9. Interlude: the infamous upper tail; 10. Isoperimetric inequalities and concentration; 11. Talagrand inequality; 12. Transportation cost and concentration; 13. Transportation cost and Talagrand's inequality; 14. Log¿Sobolev inequalities; Appendix A. Summary of the most useful bounds.
Details
Erscheinungsjahr: 2012
Fachbereich: Programmiersprachen
Genre: Informatik
Rubrik: Naturwissenschaften & Technik
Medium: Taschenbuch
Seiten: 214
ISBN-13: 9781107606609
ISBN-10: 1107606608
Sprache: Englisch
Ausstattung / Beilage: Paperback
Einband: Kartoniert / Broschiert
Autor: Panconesi, Alessandro
Hersteller: Cambridge University Press
Maße: 229 x 152 x 13 mm
Von/Mit: Alessandro Panconesi
Erscheinungsdatum: 01.03.2012
Gewicht: 0,355 kg
preigu-id: 108028041
Über den Autor
Devdatt P. Dubhashi is Professor in the Department of Computer Science and Engineering at Chalmers University, Sweden. He earned a Ph.D. in computer science from Cornell University and held positions at the Max-Planck-Institute for Computer Science in Saarbruecken, BRICS, the University of Aarhus and IIT Delhi. Dubhashi has published widely at international conferences and in journals, including many special issues dedicated to best contributions. His research interests span the range from combinatorics to probabilistic analysis of algorithms, and more recently, to computational systems biology and distributed information systems such as the Web.
Inhaltsverzeichnis
1. Chernoff¿Hoeffding bounds; 2. Applying the CH-bounds; 3. CH-bounds with dependencies; 4. Interlude: probabilistic recurrences; 5. Martingales and the MOBD; 6. The MOBD in action; 7. Averaged bounded difference; 8. The method of bounded variances; 9. Interlude: the infamous upper tail; 10. Isoperimetric inequalities and concentration; 11. Talagrand inequality; 12. Transportation cost and concentration; 13. Transportation cost and Talagrand's inequality; 14. Log¿Sobolev inequalities; Appendix A. Summary of the most useful bounds.
Details
Erscheinungsjahr: 2012
Fachbereich: Programmiersprachen
Genre: Informatik
Rubrik: Naturwissenschaften & Technik
Medium: Taschenbuch
Seiten: 214
ISBN-13: 9781107606609
ISBN-10: 1107606608
Sprache: Englisch
Ausstattung / Beilage: Paperback
Einband: Kartoniert / Broschiert
Autor: Panconesi, Alessandro
Hersteller: Cambridge University Press
Maße: 229 x 152 x 13 mm
Von/Mit: Alessandro Panconesi
Erscheinungsdatum: 01.03.2012
Gewicht: 0,355 kg
preigu-id: 108028041
Warnhinweis

Ähnliche Produkte

Ähnliche Produkte