Libros importados con hasta 50% OFF + Envío Gratis a todo USA  Ver más

menu

0
  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional
portada lecture notes on bucket algorithms (in English)
Type
Physical Book
Author
Publisher
Year
1985
Language
Inglés
Pages
148
Format
Paperback
Dimensions
22.9 x 15.2 x 0.9 cm
Weight
0.22 kg.
ISBN
0817633286
ISBN13
9780817633288

lecture notes on bucket algorithms (in English)

Devroye (Author) · Birkhauser · Paperback

lecture notes on bucket algorithms (in English) - Devroye

Physical Book

$ 52.09

$ 54.99

You save: $ 2.90

5% discount
  • Condition: New
It will be shipped from our warehouse between Monday, July 01 and Tuesday, July 02.
You will receive it anywhere in United States between 1 and 3 business days after shipment.

Synopsis "lecture notes on bucket algorithms (in English)"

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.

Customers reviews

More customer reviews
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)

Frequently Asked Questions about the Book

All books in our catalog are Original.
The book is written in English.
The binding of this edition is Paperback.

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews