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 ref. del art�culo 9780817633288

Contactar al vendedor

Denunciar este art�culo

Detalles bibliogr�ficos

T�tulo: Lecture Notes on Bucket Algorithms
Editor: Birkh�user Boston
Fecha de publicaci�n: 1986
Idioma: Ingl�s
ISBN 10: 0817633286
ISBN 13: 9780817633288
Encuadernaci�n: Taschenbuch
Estado: Neu

Acerca de

Sinopsis

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.

Rese�a del editor

"Sobre este t�tulo" puede pertenecer a otra edici�n de este libro.

Descripci�n de la librer�a

Das Unternehmen AHA-BUCH GmbH: Seit der Gr�ndung von AHA-BUCH im Juli 2005 ist unser Hauptziel, zufriedenen Kunden so schnell und so preisg�nstig wie m�glich ihren B�cherwunsch zu erf�llen. Unsere Firma besch�ftigt 16 Mitarbeiter, die nur ein Ziel kennen: den Kunden und seine W�nsche! Auf �ber 3700 m2 Fl�che haben wir �ber 100.000 B�cher, Modernes Antiquariat und Spiele auf Lager.

Ver la p�gina web de la librer�a

Informaci�n empresarial del vendedor

AHA-BUCH GmbH
Garlebsen 48, Einbeck, 37574, Germany

Condiciones de venta y env�o

Condiciones de venta

T�rminos y Condiciones Generales e Informaci�n del Cliente / Pol�tica de Privacidad

I. T�rminos y Condiciones Generales

� 1 Disposiciones b�sicas

(1)Los siguientes t�rminos y condiciones se aplican a todos los contratos que celebre con nosotros como proveedor (AHA-BUCH GmbH) a trav�s de las plataformas de Internet AbeBooks y/o ZVAB. A menos que se acuerde lo contrario, se objetar� la inclusi�n de cualquiera de sus propios t�rminos y condiciones utilizados por usted.
(2)Un consumidor en el sentid...

M�s informaci�n

Condiciones de env�o

Enviamos su pedido despu�s de recibirlos
para art�culos disponibles las �ltimas 24 horas,
para art�culos con suministro nocturno a m�s tardar 48 horas.
En caso de que necesitemos pedir un art�culo a nuestro proveedor, nuestro tiempo de env�o depende de la fecha de recepci�n de los art�culos, pero los art�culos se enviar�n el mismo d�a.

Nuestro objetivo es enviar los art�culos pedidos de la manera m�s r�pida, pero tambi�n m�s eficiente y segura a nuestros clientes.

Informaci�n detallada sobre el vendedor