Articles liés à Lecture Notes on Bucket Algorithms
Synopsis
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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Acheter neuf
Afficher cet article
EUR 48,37
EUR 9,70 expédition depuis Allemagne vers France
Destinations, frais et délais
Résultats de recherche pour Lecture Notes on Bucket Algorithms
Image d'archives
Lecture Notes on Bucket Algorithms
Edité par
Birkhäuser Boston, 1985
ISBN 10 : 0817633286
ISBN 13 : 9780817633288
Ancien ou d'occasion
Couverture souple
Vendeur : Buchpark, Trebbin, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : Sehr gut. Zustand: Sehr gut | Seiten: 160 | Sprache: Englisch | Produktart: Bücher. N° de réf. du vendeur 10342403/202
Quantité disponible : 1 disponible(s)
Image d'archives
Lecture Notes on Bucket Algorithms
Edité par
Birkhauser Boston Inc, 1985
ISBN 10 : 0817633286
ISBN 13 : 9780817633288
Ancien ou d'occasion
Softcover
Vendeur : Ammareal, Morangis, France
Évaluation du vendeur 5 sur 5 étoiles
Softcover. Etat : Très bon. Ancien livre de bibliothèque. Légères traces d'usure sur la couverture. Edition 1985. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Slight signs of wear on the cover. Edition 1985. Ammareal gives back up to 15% of this item's net price to charity organizations. N° de réf. du vendeur E-597-893
Quantité disponible : 1 disponible(s)
Image d'archives
Lecture Notes on Bucket Algorithms
Edité par
Birkhauser, 1986
ISBN 10 : 0817633286
ISBN 13 : 9780817633288
Ancien ou d'occasion
Couverture rigide
Vendeur : Munster & Company LLC, ABAA/ILAB, Corvallis, OR, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : Good. Birkhauser, 1986. Cover rubbed/bumped, lightly soiled, corners/edges/spine ends lightly rubbed/bumped, spine quite sunned; very light pencil erasures at ffep; binding tight; edges and interior intact and clean, except where noted. hardcover. Good. N° de réf. du vendeur 606733
Quantité disponible : 1 disponible(s)
Image d'archives
Lecture Notes on Bucket Algorithms
Edité par
Birkhauser, 1986
ISBN 10 : 0817633286
ISBN 13 : 9780817633288
Ancien ou d'occasion
Couverture rigide
Vendeur : Munster & Company LLC, ABAA/ILAB, Corvallis, OR, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : Good. Birkhauser, 1986. Cover very lightly rubbed/bumped; edges lightly soiled; pastedowns/endpapers faintly soiled; binding tight; cover and interior intact and clean, except where noted. hardcover. Good. N° de réf. du vendeur 606193
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Lecture Notes on Bucket Algorithms
Edité par
Birkhäuser Boston, 1985
ISBN 10 : 0817633286
ISBN 13 : 9780817633288
Neuf
Kartoniert / Broschiert
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Kartoniert / Broschiert. Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 buck. N° de réf. du vendeur 5975377
Quantité disponible : Plus de 20 disponibles
Image d'archives
Lecture Notes on Bucket Algorithms
Edité par
Secaucus, New Jersey, U.S.A.: Birkhauser, 1986
ISBN 10 : 0817633286
ISBN 13 : 9780817633288
Ancien ou d'occasion
Couverture rigide
Vendeur : Bingo Books 2, Vancouver, WA, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
Hardcover. Etat : Near Fine. hardback book in near fine conition. N° de réf. du vendeur 126504
Quantité disponible : 1 disponible(s)
Image d'archives
Lecture Notes on Bucket Algorithms
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9780817633288_new
Quantité disponible : Plus de 20 disponibles
Image d'archives
Lecture Notes on Bucket Algorithms
Vendeur : Romtrade Corp., STERLING HEIGHTS, MI, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide. N° de réf. du vendeur ABNR-87653
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Lecture Notes on Bucket Algorithms
Edité par
Birkhäuser Boston, Birkhäuser Boston Jan 1985, 1985
ISBN 10 : 0817633286
ISBN 13 : 9780817633288
Neuf
Taschenbuch
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer Basel AG in Springer Science + Business Media, Heidelberger Platz 3, 14197 Berlin 160 pp. Englisch. N° de réf. du vendeur 9780817633288
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Lecture Notes on Bucket Algorithms
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. N° de réf. du vendeur 9780817633288
Quantité disponible : 1 disponible(s)