Artículos relacionados a Concentration of Measure for Computer Science Applications...
Sinopsis
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 account of classical and more advanced techniques for analyzing the performance of such algorithms. The presentation emphasizes discrete settings and elementary notions of probability, making it accessible to computer scientists and applied discrete mathematicians.
"Sinopsis" puede pertenecer a otra edición de este libro.
Acerca de los autores
Devdatt P. Dubhashi is Professor in the Department of Computer Science and Engineering at Chalmers University, Sweden. He earned a Ph.D. in computer science from Cornell University and held positions at the Max-Planck-Institute for Computer Science in Saarbruecken, BRICS, the University of Aarhus and IIT Delhi. Dubhashi has published widely at international conferences and in journals, including many special issues dedicated to best contributions. His research interests span the range from combinatorics to probabilistic analysis of algorithms, and more recently, to computational systems biology and distributed information systems such as the Web.
Alessandro Panconesi is Professor of Computer Science at Sapienza University of Rome. He earned a Ph.D. in computer science from Cornell University and is the recipient of the 1992 ACM Danny Lewin Award. Panconesi has published more than 50 papers in international journals and selective conference proceedings and he is the associate editor of the Journal of Discrete Algorithms and the director of BiCi, the Bertinoro International Center of Informatics. His research spans areas of algorithmic research as diverse as randomized algorithms, distributed computing, complexity theory, experimental algorithmics, wireless networking and Web information retrieval.
"Sobre este título" puede pertenecer a otra edición de este libro.
EUR 67,24
EUR 87,32 gastos de envío desde Estados Unidos de America a España
Destinos, gastos y plazos de envíoComprar nuevo
Ver este artículo
EUR 157,73
EUR 5,16 gastos de envío desde Reino Unido a España
Destinos, gastos y plazos de envío
Resultados de la búsqueda para Concentration of Measure for Computer Science Applications...
Imagen de archivo
Concentration of Measure for the Analysis of Randomized Algorithms
Publicado por
Cambridge University Press, 2009
ISBN 10: 0521884276
ISBN 13: 9780521884273
Antiguo o usado
Tapa dura
Librería: Michener & Rutledge Booksellers, Inc., Baldwin City, KS, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Hardcover. Condición: Very Good. Bookplate, otherwise text clean and tight; no dust jacket; 8.90 X 6.10 X 0.90 inches; 214 pages. Nº de ref. del artículo: 208686
Cantidad disponible: 1 disponibles
Imagen de archivo
Concentration of Measure for the Analysis of Randomized Algorithms
Publicado por
Cambridge University Press, 2009
ISBN 10: 0521884276
ISBN 13: 9780521884273
Nuevo
Tapa dura
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. In. Nº de ref. del artículo: ria9780521884273_new
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Concentration of Measure for the Analysis of Randomized Algorithms
Publicado por
Cambridge University Press, 2009
ISBN 10: 0521884276
ISBN 13: 9780521884273
Nuevo
Tapa dura
Librería: California Books, Miami, FL, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: I-9780521884273
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Concentration of Measure for the Analysis of Randomized Algorithms
Impresión bajo demandaLibrería: Revaluation Books, Exeter, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Hardcover. Condición: Brand New. 1st edition. 248 pages. 8.90x6.10x0.90 inches. In Stock. This item is printed on demand. Nº de ref. del artículo: __0521884276
Cantidad disponible: 1 disponibles
Imagen de archivo
Concentration of Measure for the Analysis of Randomized Algorithms
Publicado por
Cambridge University Press, 2009
ISBN 10: 0521884276
ISBN 13: 9780521884273
Nuevo
Tapa dura
Librería: THE SAINT BOOKSTORE, Southport, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Hardback. Condición: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 480. Nº de ref. del artículo: C9780521884273
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Concentration of Measure for the Analysis of Randomized Algorithms
Publicado por
Cambridge University Press, 2010
ISBN 10: 0521884276
ISBN 13: 9780521884273
Nuevo
Tapa dura
Librería: moluna, Greven, Alemania
Calificación del vendedor: 4 de 5 estrellas
Condición: 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.Randomized algorithms have become a central part of the algorithms curriculum, based on their increasi. Nº de ref. del artículo: 446952167
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Concentration of Measure for the Analysis of Randomized Algorithms (Hardcover)
Publicado por
Cambridge University Press, Cambridge, 2009
ISBN 10: 0521884276
ISBN 13: 9780521884273
Nuevo
Tapa dura
Librería: AussieBookSeller, Truganina, VIC, Australia
Calificación del vendedor: 5 de 5 estrellas
Hardcover. Condición: new. Hardcover. 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. 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. Nº de ref. del artículo: 9780521884273
Cantidad disponible: 1 disponibles
Imagen de archivo
Concentration of Measure for the Analysis of Randomized Algorithms (Hardcover)
Publicado por
Cambridge University Press, Cambridge, 2009
ISBN 10: 0521884276
ISBN 13: 9780521884273
Nuevo
Tapa dura
Librería: CitiRetail, Stevenage, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Hardcover. Condición: new. Hardcover. 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. 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. Nº de ref. del artículo: 9780521884273
Cantidad disponible: 1 disponibles
Imagen de archivo
Concentration of Measure for the Analysis of Randomized Algorithms
Publicado por
Cambridge University Press, 2009
ISBN 10: 0521884276
ISBN 13: 9780521884273
Nuevo
Tapa dura
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: ABLIING23Feb2416190020256
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Concentration of Measure for the Analysis of Randomized Algorithms
Librería: Revaluation Books, Exeter, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Hardcover. Condición: Brand New. 1st edition. 248 pages. 8.90x6.10x0.90 inches. In Stock. Nº de ref. del artículo: x-0521884276
Cantidad disponible: 2 disponibles