Probability and Computing
- 6 %

Probability and Computing

Randomization and Probabilistic Techniques in Algorithms and Data Analysis
Sofort lieferbar | Lieferzeit:3-5 Tage I

Unser bisheriger Preis:ORGPRICE: 60,35 €

Jetzt 56,49 €*

Alle Preise inkl. MwSt. | zzgl. Versand
Michael Mitzenmacher
1158 g
259x182x27 mm

Upfal, EliEli Upfal is a Professor of Computer Science at Brown University, where he was also the department chair from 2002 to 2007. Prior to joining Brown in 1998, he was a researcher and project manager at the IBM Almaden Research Center, and a professor at the Weizmann Institute of Science, Israel. His main research interests are randomized algorithms, probabilistic analysis of algorithms, and computational statistics, with applications ranging from combinatorial and stochastic optimization, massive data analysis and sampling complexity to computational biology, and computational finance.
Greatly expanded, this new edition requires only an elementary background in discrete mathematics and offers a comprehensive introduction to the role of randomization and probabilistic techniques in modern computer science. Newly added chapters and sections cover topics including normal distributions, sample complexity, VC dimension, Rademacher complexity, power laws and related distributions, cuckoo hashing, and the Lovasz Local Lemma. Material relevant to machine learning and big data analysis enables students to learn modern techniques and applications. Among the many new exercises and examples are programming-related exercises that provide students with excellent training in solving relevant problems. This book provides an indispensable teaching tool to accompany a one- or two-semester course for advanced undergraduate students in computer science and applied mathematics.
This greatly expanded new edition offers a comprehensive introduction to randomization and probabilistic techniques in modern computer science.
1. Events and probability; 2. Discrete random variables and expectations; 3. Moments and deviations; 4. Chernoff and Hoeffding bounds; 5. Balls, bins, and random graphs; 6. The probabilistic method; 7. Markov chains and random walks; 8. Continuous distributions and the Polsson process; 9. The normal distribution; 10. Entropy, randomness, and information; 11. The Monte Carlo method; 12. Coupling of Markov chains; 13. Martingales; 14. Sample complexity, VC dimension, and Rademacher complexity; 15. Pairwise independence and universal hash functions; 16. Power laws and related distributions; 17. Balanced allocations and cuckoo hashing.

Kunden Rezensionen

Zu diesem Artikel ist noch keine Rezension vorhanden.
Helfen sie anderen Besuchern und verfassen Sie selbst eine Rezension.