Articoli correlati a Concentration of Measure for the Analysis of Randomized...
Sinossi
This book presents a coherent and unified account of classical and more advanced techniques for analyzing the performance of randomized algorithms.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Informazioni sugli autori
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.
Alessandro Panconesi is Professor of Computer Science at Sapienza University of Rome. He earned a Ph.D. in computer science from Cornell University and is the recipient of the 1992 ACM Danny Lewin Award. Panconesi has published more than 50 papers in international journals and selective conference proceedings and he is the associate editor of the Journal of Discrete Algorithms and the director of BiCi, the Bertinoro International Center of Informatics. His research spans areas of algorithmic research as diverse as randomized algorithms, distributed computing, complexity theory, experimental algorithmics, wireless networking and Web information retrieval.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Compra nuovo
Visualizza questo articolo
EUR 50,47
EUR 3,43 per la spedizione in U.S.A.
Destinazione, tempi e costi
Risultati della ricerca per Concentration of Measure for the Analysis of Randomized...
Foto dell'editore
Concentration of Measure for the Analysis of Randomized Algorithms
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo ABLIING23Mar2317530272281
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Concentration of Measure for the Analysis of Randomized Algorithms
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo 15949567-n
Quantità: Più di 20 disponibili
Foto dell'editore
Concentration of Measure for the Analysis of Randomized Algorithms
Da: California Books, Miami, FL, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo I-9781107606609
Quantità: Più di 20 disponibili
Foto dell'editore
Concentration of Measure for the Analysis of Randomized Algorithms
Editore:
Cambridge University Press CUP, 2012
ISBN 10: 1107606608
ISBN 13: 9781107606609
Nuovo
Brossura
Da: Books Puddle, New York, NY, U.S.A.
Valutazione del venditore 4 su 5 stelle
Condizione: New. pp. 214. Codice articolo 2614410421
Quantità: 1 disponibili
Immagini fornite dal venditore
Concentration of Measure for the Analysis of Randomized Algorithms
Editore:
Cambridge University Press, 2012
ISBN 10: 1107606608
ISBN 13: 9781107606609
Antico o usato
Brossura
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: As New. Unread book in perfect condition. Codice articolo 15949567
Quantità: Più di 20 disponibili
Foto dell'editore
Concentration of Measure for the Analysis of Randomized Algorithms (Paperback)
Editore:
Cambridge University Press, Cambridge, 2012
ISBN 10: 1107606608
ISBN 13: 9781107606609
Nuovo
Paperback
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: new. Paperback. Randomized algorithms have become a central part of the algorithms curriculum, based on their increasingly widespread use in modern applications. This book presents a coherent and unified treatment of probabilistic techniques for obtaining high probability estimates on the performance of randomized algorithms. It covers the basic toolkit from the ChernoffHoeffding bounds to more sophisticated techniques like martingales and isoperimetric inequalities, as well as some recent developments like Talagrand's inequality, transportation cost inequalities and log-Sobolev inequalities. Along the way, variations on the basic theme are examined, such as ChernoffHoeffding bounds in dependent settings. The authors emphasise comparative study of the different methods, highlighting respective strengths and weaknesses in concrete example applications. The exposition is tailored to discrete settings sufficient for the analysis of algorithms, avoiding unnecessary measure-theoretic details, thus making the book accessible to computer scientists as well as probabilists and discrete mathematicians. This book presents a coherent and unified account of classical and more advanced techniques for analyzing the performance of randomized algorithms. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Codice articolo 9781107606609
Quantità: 1 disponibili
Foto dell'editore
Concentration of Measure for the Analysis of Randomized Algorithms
Da: Majestic Books, Hounslow, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. pp. 214 12 Illus. Codice articolo 11296106
Quantità: 1 disponibili
Foto dell'editore
Concentration of Measure for the Analysis of Randomized Algorithms
Da: Biblios, Frankfurt am main, HESSE, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: New. pp. 214. Codice articolo 1814410431
Quantità: 1 disponibili
Foto dell'editore
Concentration of Measure for the Analysis of Randomized Algorithms
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. In. Codice articolo ria9781107606609_new
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Concentration of Measure for the Analysis of Randomized Algorithms
Editore:
Cambridge University Press, GB, 2012
ISBN 10: 1107606608
ISBN 13: 9781107606609
Nuovo
Paperback
Da: Rarewaves.com USA, London, LONDO, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: New. Randomized algorithms have become a central part of the algorithms curriculum, based on their increasingly widespread use in modern applications. This book presents a coherent and unified treatment of probabilistic techniques for obtaining high probability estimates on the performance of randomized algorithms. It covers the basic toolkit from the Chernoff-Hoeffding bounds to more sophisticated techniques like martingales and isoperimetric inequalities, as well as some recent developments like Talagrand's inequality, transportation cost inequalities and log-Sobolev inequalities. Along the way, variations on the basic theme are examined, such as Chernoff-Hoeffding bounds in dependent settings. The authors emphasise comparative study of the different methods, highlighting respective strengths and weaknesses in concrete example applications. The exposition is tailored to discrete settings sufficient for the analysis of algorithms, avoiding unnecessary measure-theoretic details, thus making the book accessible to computer scientists as well as probabilists and discrete mathematicians. Codice articolo LU-9781107606609
Quantità: Più di 20 disponibili