Sprache: Englisch
Verlag: Cambridge University Press, 2009
ISBN 10: 0521884276 ISBN 13: 9780521884273
Anbieter: ThriftBooks-Atlanta, AUSTELL, GA, USA
Hardcover. Zustand: Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less.
Sprache: Englisch
Verlag: Cambridge University Press, 2009
ISBN 10: 0521884276 ISBN 13: 9780521884273
Anbieter: WeBuyBooks, Rossendale, LANCS, Vereinigtes Königreich
EUR 30,82
Anzahl: 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. A few small stains.
Sprache: Englisch
Verlag: Cambridge University Press, 2009
ISBN 10: 0521884276 ISBN 13: 9780521884273
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 162,97
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
EUR 224,22
Anzahl: 2 verfügbar
In den WarenkorbHardcover. Zustand: Brand New. 1st edition. 248 pages. 8.90x6.10x0.90 inches. In Stock.
Sprache: Englisch
Verlag: Cambridge University Press, 2009
ISBN 10: 0521884276 ISBN 13: 9780521884273
Anbieter: Kennys Bookstore, Olney, MD, USA
EUR 229,59
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: 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: UYA. Category: (P) Professional & Vocational. Dimension: 236 x 162 x 21. Weight in Grams: 458. . 2009. 1st Edition. hardcover. . . . . Books ship from the US and Ireland.
Sprache: Englisch
Verlag: Cambridge University Press, 2009
ISBN 10: 0521884276 ISBN 13: 9780521884273
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch. 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.