Language: English
Published by Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New.
Language: English
Published by Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
Language: English
Published by Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Unread book in perfect condition.
Language: English
Published by Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
Language: English
Published by Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Condition: New.
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New.
Condition: New.
Language: English
Published by Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Seller: California Books, Miami, FL, U.S.A.
Condition: New.
Language: English
Published by Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
US$ 52.06
Quantity: 1 available
Add to basketCondition: New.
Language: English
Published by Cambridge University Press, Cambridge, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.
Paperback. Condition: 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.
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Unread book in perfect condition.
Language: English
Published by Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
US$ 56.47
Quantity: 1 available
Add to basketCondition: As New. Unread book in perfect condition.
Language: English
Published by Cambridge University Press, GB, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Seller: Rarewaves.com USA, London, LONDO, United Kingdom
US$ 76.80
Quantity: Over 20 available
Add to basketPaperback. Condition: 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.
Language: English
Published by Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Seller: Ria Christie Collections, Uxbridge, United Kingdom
US$ 65.94
Quantity: Over 20 available
Add to basketCondition: New. In.
Language: English
Published by Cambridge University Press, 2009
ISBN 10: 0521884276 ISBN 13: 9780521884273
Seller: Michener & Rutledge Booksellers, Inc., Baldwin City, KS, U.S.A.
Hardcover. Condition: Very Good. Bookplate, otherwise text clean and tight; no dust jacket; 8.90 X 6.10 X 0.90 inches; 214 pages.
Language: English
Published by Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
US$ 65.07
Quantity: 1 available
Add to basketPaperback / softback. Condition: New. New copy - Usually dispatched within 4 working days.
Language: English
Published by Cambridge University Press CUP, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Seller: Books Puddle, New York, NY, U.S.A.
Condition: New. pp. 214.
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
US$ 80.24
Quantity: Over 20 available
Add to basketCondition: New.
Language: English
Published by Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Seller: Revaluation Books, Exeter, United Kingdom
US$ 87.15
Quantity: 2 available
Add to basketPaperback. Condition: Brand New. 216 pages. 8.90x5.90x0.70 inches. In Stock.
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
US$ 81.02
Quantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
Language: English
Published by Springer-Verlag New York Inc, 2011
ISBN 10: 3642226051 ISBN 13: 9783642226052
Seller: Revaluation Books, Exeter, United Kingdom
US$ 97.41
Quantity: 2 available
Add to basketPaperback. Condition: Brand New. 2011 edition. 562 pages. 9.25x6.00x1.25 inches. In Stock.
Seller: Ria Christie Collections, Uxbridge, United Kingdom
US$ 110.54
Quantity: Over 20 available
Add to basketCondition: New. In.
Seller: Chiron Media, Wallingford, United Kingdom
US$ 110.60
Quantity: 10 available
Add to basketPF. Condition: New.
Language: English
Published by Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Seller: preigu, Osnabrück, Germany
Taschenbuch. Condition: Neu. Concentration of Measure for the Analysis of Randomized Algorithms | Devdatt P. Dubhashi (u. a.) | Taschenbuch | Kartoniert / Broschiert | Englisch | 2012 | Cambridge University Press | EAN 9781107606609 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu.
Language: English
Published by Springer Berlin Heidelberg, 2011
ISBN 10: 3642226051 ISBN 13: 9783642226052
Seller: AHA-BUCH GmbH, Einbeck, Germany
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - This volume constitutes the refereed proceedings of the Fourth International Conference on Contemporary Computing, IC3 2010, held in Noida, India, in August 2011. The 58 revised full papers presented were carefully reviewed and selected from 175 submissions.
Language: English
Published by Cambridge University Press Mär 2012, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Seller: AHA-BUCH GmbH, Einbeck, Germany
Taschenbuch. Condition: Neu. Neuware - 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.
Language: English
Published by Cambridge University Press, GB, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Seller: Rarewaves.com UK, London, United Kingdom
US$ 74.40
Quantity: Over 20 available
Add to basketPaperback. Condition: 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.
Language: English
Published by Springer Berlin Heidelberg, 2011
ISBN 10: 3642226051 ISBN 13: 9783642226052
Seller: Buchpark, Trebbin, Germany
Condition: Sehr gut. Zustand: Sehr gut | Seiten: 584 | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.
Language: English
Published by Cambridge University Press, 2009
ISBN 10: 0521884276 ISBN 13: 9780521884273
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Condition: New.
Language: English
Published by Cambridge University Press, 2009
ISBN 10: 0521884276 ISBN 13: 9780521884273
Seller: California Books, Miami, FL, U.S.A.
Condition: New.