Articoli correlati a Lecture Notes on Bucket Algorithms: 6
Sinossi
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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Compra nuovo
Visualizza questo articolo
EUR 53,06
EUR 2,25 per la spedizione in U.S.A.
Destinazione, tempi e costi
Risultati della ricerca per Lecture Notes on Bucket Algorithms: 6
Foto dell'editore
Lecture Notes on Bucket Algorithms
Da: Munster & Company LLC, ABAA/ILAB, Corvallis, OR, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: 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. Codice articolo 606733
Quantità: 1 disponibili
Foto dell'editore
Lecture Notes on Bucket Algorithms
Da: Munster & Company LLC, ABAA/ILAB, Corvallis, OR, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: 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. Codice articolo 606193
Quantità: 1 disponibili
Foto dell'editore
Lecture Notes on Bucket Algorithms
Editore:
Birkhauser Boston Inc, 1985
ISBN 10: 0817633286
ISBN 13: 9780817633288
Antico o usato
Softcover
Da: Ammareal, Morangis, Francia
Valutazione del venditore 5 su 5 stelle
Softcover. Condizione: 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. Codice articolo E-597-893
Quantità: 1 disponibili
Foto dell'editore
Lecture Notes on Bucket Algorithms
Editore:
Secaucus, New Jersey, U.S.A.: Birkhauser, 1986
ISBN 10: 0817633286
ISBN 13: 9780817633288
Antico o usato
Rilegato
Da: Bingo Books 2, Vancouver, WA, U.S.A.
Valutazione del venditore 4 su 5 stelle
Hardcover. Condizione: Near Fine. hardback book in near fine conition. Codice articolo 126504
Quantità: 1 disponibili
Immagini fornite dal venditore
Lecture Notes on Bucket Algorithms
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo 21776873-n
Quantità: 15 disponibili
Foto dell'editore
Lecture Notes on Bucket Algorithms
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo ABLIING23Feb2416190237239
Quantità: Più di 20 disponibili
Foto dell'editore
Lecture Notes on Bucket Algorithms (Paperback)
Editore:
Birkhauser Boston Inc, Secaucus, 1985
ISBN 10: 0817633286
ISBN 13: 9780817633288
Nuovo
Paperback
Da: Grand Eagle Retail, Mason, OH, U.S.A.
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: new. Paperback. 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. Hashing algorithms scramble data and create pseudo-uniform data distribuA tions. Bucket algorithms operate on raw untransformed data which are partiA tioned Into groups according to membership In equl-slzed d-dlmenslonal hyperrecA 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 disA 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 operat Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Codice articolo 9780817633288
Quantità: 1 disponibili
Foto dell'editore
Lecture Notes on Bucket Algorithms
Da: Best Price, Torrance, CA, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. SUPER FAST SHIPPING. Codice articolo 9780817633288
Quantità: 1 disponibili
Immagini fornite dal venditore
Lecture Notes on Bucket Algorithms
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: As New. Unread book in perfect condition. Codice articolo 21776873
Quantità: 15 disponibili
Foto dell'editore
Lecture Notes on Bucket Algorithms
Da: Books Puddle, New York, NY, U.S.A.
Valutazione del venditore 4 su 5 stelle
Condizione: New. pp. 160. Codice articolo 263131652
Quantità: 1 disponibili