Normal view MARC view ISBD view

Probability and computing / Michael Mitzenmacher Eli Upfal.

By:

Mitzenmacher, Michael

Contributor(s):

Upfal, Eli

Material type: Text

TextLanguage: English Publication details: Nw York: Cambridge, 2012Edition: Second editionDescription: xvi,352pISBN:

9780521835400

Subject(s):

DDC classification:

519.2 MIT

Online resources:

Summary: "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"--

Tags from this library: No tags from this library for this title.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Call number	Status	Date due	Barcode
Books	Department of Computer Science General Stacks	519.2 MIT (Browse shelf(Opens below))	Available		MCS06148

Browsing Department of Computer Science shelves, Shelving location: General Stacks Close shelf browser (Hides shelf browser)

Previous				No cover image available				Next
Previous	519.2 MCK Statistics explained :	519.2 MEN Introduction to probability and statistics.	519.2 MIL Probability and random processes :	519.2 MIT Probability and computing /	519.2 MIT Probability and computing /	519.2 RAM Mathematical statistics with applications /	519.2 RAM Mathematical statistics with applications /	Next

"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"--

There are no comments on this title.

to post a comment.