Wyniki wyszukiwania:

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 tool kit from the Chernoff-Hoeffding (CH) 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...

This book presents a coherent and unified account of classical and more advanced techniques for analyzing the performance of randomized algorithms.

This book explores the profound legacy of Alan Turing, and how his five great ideas have been developed by the winners of the Turing Prize to shape the digital world we live in today. These five groundbreaking concepts—universal computability and insolvability, cryptography, electronic digital computers and software, artificial intelligence (AI), and computational biology—serve as the pillars of the narrative.

Turing's Children makes the complex ideas in the work of the Turing prize winners accessible to a broad audience. It traces the evolution of these ideas...

This book explores the profound legacy of Alan Turing, and how his five great ideas have been developed by the winners of the Turing Prize to shape the digital world we live in today.

These five groundbreaking concepts—universal computability and insolvability, cryptography, electronic digital computers and software, artificial intelligence (AI), and computational biology—serve as the pillars of the narrative.

Turing's Children makes the complex ideas in the work of the Turing prize winners accessible to a broad audience. It traces the evolution of these...