Lecture Notes on Bucket Algorithms - Devroye
-25% koodilla BOOKS
Toimitus 12-18 arkipäivässä
30 päivän palautusoikeus
Hashing algorithms scramble data and create pseudo-uniform data distribu tions. Bucket algorithms operate on raw untransformed data which are parti tioned Into groups according to membership In equl-slzed d-dlmenslonal hyperrec tangles, called cells or buckets. The bucket data structure Is rather sensitive to the distribution of the data. In these lecture notes, we attempt to explain the connection betwe ... Täydellinen kuvaus
Saatat myös pitää
TOP
The Demon-Haunted World: Science as a Candle in the Dark
-25% koodilla BOOKS
Loppu
TOP
Heart Rate Variability: Science and Strategies for Peak Performance
Marco Altini, Sylvain Laborde, Dan Plews, Emma Mosley
-25% koodilla BOOKS
Loppu
TOP
Many Faces, One Purpose: A Managers Handbook on Women in Firefighting
U. S. Fire Administration, Homeland Security
-25% koodilla BOOKS
Loppu
TOP
The Gulf Moment: Arab Relations Since 2011
Florence Gaub, U. S. Army War College, Strategic Studies Institute
-25% koodilla BOOKS
Loppu
TOP
Introduction to Algorithms
Ronald L. Rivest, Charles E. Leiserson, Clifford Stein, Thomas H. Cormen
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
Thinking in Systems: International Bestseller
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
101 Things I Learned in Architecture School
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
Skin in the Game: Hidden Asymmetries in Daily Life
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
Dinosaurs and Prehistoric Life: The Definitive Visual Guide to Prehistoric Animals
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
International Economics: Theory and Policy, Global Edition
Paul Krugman, Maurice Obstfeld, Marc Melitz
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
Nudge: Improving Decisions About Health, Wealth and Happiness
Cass R Sunstein, Richard H. Thaler
-25% koodilla BOOKS
Varastossa
TOP
Crossing Borders: About the birth of the Consortium of European Research Libraries, the organisation's early years and its path to maturity, spanning the period from the late twentieth century to the first decades of the twenty-first century
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
The Code Book: The Science of Secrecy from Ancient Egypt to Quantum Cryptography
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
Cybernetics: Second Edition: Or the Control and Communication in the Animal and the Machine
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
The Unaccountability Machine: Why Big Systems Make Terrible Decisions
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
Only Dull People Are Brilliant at Breakfast
-24% koodilla BOOKS
Toimittajalla varastossa
TOP
The Dictionary of Obscure Sorrows
-25% koodilla BOOKS
Toimittajalla varastossa
Kuvaus
Hashing algorithms scramble data and create pseudo-uniform data distribu tions. Bucket algorithms operate on raw untransformed data which are parti tioned Into groups according to membership In equl-slzed d-dlmenslonal hyperrec tangles, called cells or buckets. The bucket data structure Is rather sensitive to the distribution of the data. In these lecture notes, we attempt to explain the connection between the expected time of various bucket algorithms and the dis tribution of the data. The results are Illustrated on standard searching, sorting and selection problems, as well as on a variety of problems In computational geometry and operations research. The notes grew partially from a graduate course on probability theory In computer science. I wish to thank Elizabeth Van Gulick for her help with the manuscript, and David Avis, Hanna AYukawa, Vasek Chvatal, Beatrice Devroye, Hossam EI Glndy, Duncan McCallum, Magda McCallum, Godfrled Toussaint and Sue Whltesldes"for making the School of Computer Science at McGill University such an enjoyable place. The work was supported by NSERC Grant A3456 and by FCAC Grant EQ-1679. INTRODUCTION 1 INTRODUCTION It Is not a secret that methods based upon the truncation of data have good expected time performance. For example, for nice distributions of the data, searching Is often better done via a hashing data structure Instead of via a search tree. The speed one observes In practice Is due to the fact that the truncation operation Is a constant time operation.
Lisätietoja
| Kirjoittaja | Devroye |
|---|---|
| Julkaisija | Birkhäuser Boston |
| Series | Progress in Computer Science and Applied Logic |
| Julkaisuvuosi | 1985 |
| Kannen tyyppi | Pehmeäkantinen |
| EAN | 9780817633288 |