Verlag: Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Sprache: Englisch
Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes Königreich
EUR 60,16
Währung umrechnenAnzahl: 1 verfügbar
In den WarenkorbPAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000.
Verlag: Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Sprache: Englisch
Anbieter: Majestic Books, Hounslow, Vereinigtes Königreich
EUR 58,21
Währung umrechnenAnzahl: 1 verfügbar
In den WarenkorbZustand: New. pp. 214 12 Illus.
Verlag: Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Sprache: Englisch
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 55,74
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
Verlag: Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Sprache: Englisch
Anbieter: PBShop.store US, Wood Dale, IL, USA
EUR 72,17
Währung umrechnenAnzahl: 1 verfügbar
In den WarenkorbPAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000.
Verlag: Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Sprache: Englisch
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
EUR 75,10
Währung umrechnenAnzahl: 2 verfügbar
In den WarenkorbPaperback. Zustand: Brand New. 216 pages. 8.90x5.90x0.70 inches. In Stock.
Verlag: Cambridge University Press Mär 2012, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Sprache: Englisch
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
EUR 59,71
Währung umrechnenAnzahl: 1 verfügbar
In den WarenkorbTaschenbuch. Zustand: 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.
Verlag: Cambridge University Press, 2009
ISBN 10: 0521884276 ISBN 13: 9780521884273
Sprache: Englisch
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 157,44
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
Verlag: Cambridge University Press, 2009
ISBN 10: 0521884276 ISBN 13: 9780521884273
Sprache: Englisch
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
EUR 228,71
Währung umrechnenAnzahl: 1 verfügbar
In den WarenkorbBuch. Zustand: 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.
Verlag: Cambridge University Press
ISBN 10: 0174202946 ISBN 13: 9780174202943
Anbieter: WeBuyBooks, Rossendale, LANCS, Vereinigtes Königreich
EUR 72,26
Währung umrechnenAnzahl: 1 verfügbar
In den WarenkorbZustand: Good. Most items will be dispatched the same or the next working day. A copy that has been read but remains in clean condition. All of the pages are intact and the cover is intact and the spine may show signs of wear. The book may have minor markings which are not specifically mentioned. Ex library copy with usual stamps & stickers.