Importo totale (1 articolo articoli):
Destinazione ordine:
concentration measure analysis randomized di dubhashi devdatt (34 risultati)
Vai alla pagina principale dei risultati di ricerca
Filtri di ricerca
Tipo di articolo
- Tutti i tipi di prodotto
- Libri (34)
- Riviste e Giornali (Nessun altro risultato corrispondente a questo perfezionamento)
- Fumetti (Nessun altro risultato corrispondente a questo perfezionamento)
- Spartiti (Nessun altro risultato corrispondente a questo perfezionamento)
- Arte, Stampe e Poster (Nessun altro risultato corrispondente a questo perfezionamento)
- Fotografie (Nessun altro risultato corrispondente a questo perfezionamento)
- Mappe (Nessun altro risultato corrispondente a questo perfezionamento)
- Manoscritti e Collezionismo cartaceo (Nessun altro risultato corrispondente a questo perfezionamento)
Condizioni Maggiori informazioni
- Nuovo (29)
- Come nuovo, Ottimo o Quasi ottimo (3)
- Molto buono o Buono (2)
- Discreto o Mediocre (Nessun altro risultato corrispondente a questo perfezionamento)
- Come descritto (Nessun altro risultato corrispondente a questo perfezionamento)
Legatura
Ulteriori caratteristiche
- Prima ed. (Nessun altro risultato corrispondente a questo perfezionamento)
- Copia autograf. (Nessun altro risultato corrispondente a questo perfezionamento)
- Sovracoperta (Nessun altro risultato corrispondente a questo perfezionamento)
- Con foto (12)
- Non Print on Demand (28)
Lingua (2)
Spedizione gratuita
Paese del venditore
Valutazione venditore
-
Concentration of Measure for the Analysis of Randomized Algorithms
Editore: Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Lingua: Inglese
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
EUR 51,59
Convertire valutaEUR 2,27 per la spedizione in U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Editore: Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Lingua: Inglese
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
EUR 50,40
Convertire valutaEUR 3,43 per la spedizione in U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Editore: Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Lingua: Inglese
Da: California Books, Miami, FL, U.S.A.
Valutazione del venditore 5 su 5 stelle
EUR 57,49
Convertire valutaGratis per la spedizione in U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Editore: Cambridge University Press CUP, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Lingua: Inglese
Da: Books Puddle, New York, NY, U.S.A.
Valutazione del venditore 4 su 5 stelle
EUR 57,02
Convertire valutaEUR 3,43 per la spedizione in U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloCondizione: New. pp. 214.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Editore: Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Lingua: Inglese
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
EUR 59,61
Convertire valutaEUR 2,27 per la spedizione in U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
-
Concentration of Measure for the Analysis of Randomized Algorithms (Paperback)
Editore: Cambridge University Press, Cambridge, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Lingua: Inglese
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
EUR 62,43
Convertire valutaGratis per la spedizione in U.S.A.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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Editore: Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Lingua: Inglese
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 60,77
Convertire valutaEUR 4,79 per la spedizione da Regno Unito a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloPAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Editore: Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Lingua: Inglese
Da: Majestic Books, Hounslow, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 57,99
Convertire valutaEUR 7,48 per la spedizione da Regno Unito a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloCondizione: New. pp. 214 12 Illus.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Editore: Cambridge University Press, GB, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Lingua: Inglese
Da: Rarewaves.com USA, London, LONDO, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 69,73
Convertire valutaGratis per la spedizione da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloPaperback. 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.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Editore: Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Lingua: Inglese
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 55,88
Convertire valutaEUR 13,79 per la spedizione da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Editore: Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Lingua: Inglese
Da: PBShop.store US, Wood Dale, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
EUR 71,90
Convertire valutaGratis per la spedizione in U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloPAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Editore: Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Lingua: Inglese
Da: Biblios, Frankfurt am main, HESSE, Germania
Valutazione del venditore 5 su 5 stelle
EUR 59,92
Convertire valutaEUR 9,95 per la spedizione da Germania a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloCondizione: New. pp. 214.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Editore: Cambridge University Press, 2009
ISBN 10: 0521884276 ISBN 13: 9780521884273
Lingua: Inglese
Da: Michener & Rutledge Booksellers, Inc., Baldwin City, KS, U.S.A.
Valutazione del venditore 5 su 5 stelle
EUR 66,78
Convertire valutaEUR 5,15 per la spedizione in U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: Very Good. Bookplate, otherwise text clean and tight; no dust jacket; 8.90 X 6.10 X 0.90 inches; 214 pages.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Editore: Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Lingua: Inglese
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 55,87
Convertire valutaEUR 17,26 per la spedizione da Regno Unito a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloCondizione: New.
-
Concentration of Measure for the Analysis of Randomized Algorithms (Paperback or Softback)
Editore: Cambridge University Press 3/12/2012, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Lingua: Inglese
Da: BargainBookStores, Grand Rapids, MI, U.S.A.
Valutazione del venditore 5 su 5 stelle
EUR 80,57
Convertire valutaGratis per la spedizione in U.S.A.Quantità: 5 disponibili
Aggiungi al carrelloPaperback or Softback. Condizione: New. Concentration of Measure for the Analysis of Randomized Algorithms. Book.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Editore: Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Lingua: Inglese
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 63,45
Convertire valutaEUR 17,26 per la spedizione da Regno Unito a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Editore: Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Lingua: Inglese
Da: Revaluation Books, Exeter, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 74,87
Convertire valutaEUR 28,77 per la spedizione da Regno Unito a U.S.A.Quantità: 2 disponibili
Aggiungi al carrelloPaperback. Condizione: Brand New. 216 pages. 8.90x5.90x0.70 inches. In Stock.
-
Concentration of Measure for the Analysis of Randomized Algorithms (Paperback)
Editore: Cambridge University Press, Cambridge, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Lingua: Inglese
Da: CitiRetail, Stevenage, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 62,22
Convertire valutaEUR 42,58 per la spedizione da Regno Unito a U.S.A.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. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.
-
Concentration of Measure for the Analysis of Randomized Algorithms (Paperback)
Editore: Cambridge University Press, Cambridge, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Lingua: Inglese
Da: AussieBookSeller, Truganina, VIC, Australia
Valutazione del venditore 5 su 5 stelle
EUR 80,65
Convertire valutaEUR 31,77 per la spedizione da Australia a U.S.A.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. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Editore: Cambridge University Press Mär 2012, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Lingua: Inglese
EUR 59,71
Convertire valutaEUR 61,78 per la spedizione da Germania a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: 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.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Editore: Cambridge University Press, GB, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Lingua: Inglese
Da: Rarewaves.com UK, London, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 64,91
Convertire valutaEUR 74,81 per la spedizione da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloPaperback. 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.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Editore: Cambridge University Press, 2009
ISBN 10: 0521884276 ISBN 13: 9780521884273
Lingua: Inglese
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
EUR 144,92
Convertire valutaEUR 3,43 per la spedizione in U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Editore: Cambridge University Press, 2009
ISBN 10: 0521884276 ISBN 13: 9780521884273
Lingua: Inglese
Da: California Books, Miami, FL, U.S.A.
Valutazione del venditore 5 su 5 stelle
EUR 163,62
Convertire valutaGratis per la spedizione in U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Editore: Cambridge University Press, 2009
ISBN 10: 0521884276 ISBN 13: 9780521884273
Lingua: Inglese
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 157,83
Convertire valutaEUR 13,79 per la spedizione da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Da: Revaluation Books, Exeter, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 214,29
Convertire valutaEUR 28,77 per la spedizione da Regno Unito a U.S.A.Quantità: 2 disponibili
Aggiungi al carrelloHardcover. Condizione: Brand New. 1st edition. 248 pages. 8.90x6.10x0.90 inches. In Stock.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Editore: Cambridge University Press, 2009
ISBN 10: 0521884276 ISBN 13: 9780521884273
Lingua: Inglese
EUR 228,71
Convertire valutaEUR 62,53 per la spedizione da Germania a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloBuch. 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.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Editore: Cambridge University Press, 2009
ISBN 10: 0521884276 ISBN 13: 9780521884273
Lingua: Inglese
Da: Mispah books, Redhill, SURRE, Regno Unito
Valutazione del venditore 4 su 5 stelle
EUR 277,39
Convertire valutaEUR 28,77 per la spedizione da Regno Unito a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: Like New. Like New. book.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Editore: Cambridge University Press
ISBN 10: 0174202946 ISBN 13: 9780174202943
Da: WeBuyBooks, Rossendale, LANCS, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 83,83
Convertire valutaEUR 6,79 per la spedizione da Regno Unito a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloCondizione: 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.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Editore: Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Lingua: Inglese
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 58,81
Convertire valutaEUR 16,52 per la spedizione da Regno Unito a U.S.A.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 360.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Editore: Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Lingua: Inglese
Da: Revaluation Books, Exeter, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 55,58
Convertire valutaEUR 28,77 per la spedizione da Regno Unito a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: Brand New. 216 pages. 8.90x5.90x0.70 inches. In Stock. This item is printed on demand.
