Probability and Computing (inbunden)
Fler böcker inom
Format
Inbunden (Hardback)
Språk
Engelska
Utgivningsdatum
2017-07-03
Upplaga
2
Förlag
Cambridge University Press
Dimensioner
254 x 180 x 28 mm
Vikt
1112 g
ISBN
9781107154889

Probability and Computing

Randomization and Probabilistic Techniques in Algorithms and Data Analysis

av Michael Mitzenmacher, Eli Upfal, Michael Mitzenmacher, Eli Upfal
Inbunden,  Engelska, 2017-07-03
687
Köp
Spara som favorit
  • Skickas från oss inom 7-10 vardagar.
  • Fri frakt över 249 kr för privatkunder i Sverige.
Finns även som
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.

Passar bra ihop

  1. Probability and Computing
  2. +
  3. Braiding Sweetgrass

De som köpt den här boken har ofta också köpt Braiding Sweetgrass av Robin Wall Kimmerer (häftad).

Köp båda 2 för 816 kr

Kundrecensioner

Har du läst boken? Sätt ditt betyg »

Fler böcker av författarna

  • Algorithms and Models for the Web Graph

    Algorithms and Models for the Web Graph

    Anthony Bonato, Michael Mitzenmacher, Pawel Pralat

    This book constitutes the refereed proceedings of the 10th International Workshop on Algorithms and Models for the Web Graph, WAW 2013, held in Cambridge, MA, USA, in December 2013. The 17 papers presented were carefully reviewed and selected for ...

    562
    Köp
    Skickas inom vardagar.

Övrig information

Michael Mitzenmacher is a Professor of Computer Science in the School of Engineering and Applied Sciences at Harvard University, Massachusetts. Professor Mitzenmacher has authored or co-authored over 200 conference and journal publications on a variety of topics, including algorithms for the internet, efficient hash-based data structures, erasure and error-correcting codes, power laws, and compression. His work on low-density parity-check codes shared the 2002 IEEE Information Theory Society Best Paper Award and won the 2009 ACM SIGCOMM Test of Time Award. He was elected as the Chair of the ACM Special Interest Group on Algorithms and Computation Theory in 2015. Eli 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.

Du kanske gillar