Lingua: Inglese
Editore: Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 59,74
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Lingua: Inglese
Editore: Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Da: California Books, Miami, FL, U.S.A.
EUR 62,13
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Lingua: Inglese
Editore: Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 62,29
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Lingua: Inglese
Editore: Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 58,62
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Lingua: Inglese
Editore: Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 58,61
Quantità: 1 disponibili
Aggiungi al carrelloCondizione: New.
Lingua: Inglese
Editore: Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
EUR 65,41
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. This book presents a coherent and unified account of classical and more advanced techniques for analyzing the performance of randomized algorithms. Num Pages: 214 pages, 12 b/w illus. 168 exercises. BIC Classification: PBD; PBT; UMB. Category: (P) Professional & Vocational. Dimension: 227 x 153 x 13. Weight in Grams: 32. . 2012. Illustrated. paperback. . . . .
Lingua: Inglese
Editore: Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 67,26
Quantità: 1 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Lingua: Inglese
Editore: Cambridge University Press CUP, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New. pp. 214.
Lingua: Inglese
Editore: Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Da: Revaluation Books, Exeter, Regno Unito
EUR 79,74
Quantità: 2 disponibili
Aggiungi al carrelloPaperback. Condizione: Brand New. 216 pages. 8.90x5.90x0.70 inches. In Stock.
Lingua: Inglese
Editore: Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Da: Kennys Bookstore, Olney, MD, U.S.A.
EUR 82,47
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. This book presents a coherent and unified account of classical and more advanced techniques for analyzing the performance of randomized algorithms. Num Pages: 214 pages, 12 b/w illus. 168 exercises. BIC Classification: PBD; PBT; UMB. Category: (P) Professional & Vocational. Dimension: 227 x 153 x 13. Weight in Grams: 32. . 2012. Illustrated. paperback. . . . . Books ship from the US and Ireland.
Lingua: Inglese
Editore: Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 79,28
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.
Lingua: Inglese
Editore: Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Da: Revaluation Books, Exeter, Regno Unito
EUR 59,01
Quantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: Brand New. 216 pages. 8.90x5.90x0.70 inches. In Stock. This item is printed on demand.
Lingua: Inglese
Editore: Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
EUR 63,01
Quantità: Più di 20 disponibili
Aggiungi al carrelloPaperback / softback. Condizione: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.
Lingua: Inglese
Editore: Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Da: Majestic Books, Hounslow, Regno Unito
EUR 83,13
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. Print on Demand pp. 214 12 Illus.
Lingua: Inglese
Editore: Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Da: Biblios, Frankfurt am main, HESSE, Germania
EUR 83,51
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. PRINT ON DEMAND pp. 214.
Lingua: Inglese
Editore: Cambridge University Press, Cambridge, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Da: CitiRetail, Stevenage, Regno Unito
EUR 66,71
Quantità: 1 disponibili
Aggiungi al carrelloPaperback. 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. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.
Lingua: Inglese
Editore: Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Da: moluna, Greven, Germania
EUR 63,55
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This book presents a coherent and unified account of classical and more advanced techniques for analyzing the performance of randomized algorithms.Über den AutorDevdatt P. Dubhashi is Professor in the Department of Computer Scie.