EUR 18,08
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierEtat : Sehr gut. Zustand: Sehr gut | Seiten: 160 | Sprache: Englisch | Produktart: Bücher.
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.
Vendeur : Munster & Company LLC, ABAA/ILAB, Corvallis, OR, Etats-Unis
EUR 13,99
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierEtat : 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.
Vendeur : Munster & Company LLC, ABAA/ILAB, Corvallis, OR, Etats-Unis
EUR 15,39
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierEtat : 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.
Vendeur : books4less (Versandantiquariat Petra Gros GmbH & Co. KG), Welling, Allemagne
EUR 39,95
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au paniergebundene Ausgabe. Etat : Gut. 146 Seiten; graph. Darst. ; Der Erhaltungszustand des hier angebotenen Werks ist trotz seiner Bibliotheksnutzung sehr sauber. Es befindet sich neben dem Rückenschild lediglich ein Bibliotheksstempel im Buch; ordnungsgemäß entwidmet. In ENGLISCHER Sprache. Sprache: Englisch Gewicht in Gramm: 400.
Edité par Secaucus, New Jersey, U.S.A.: Birkhauser, 1986
ISBN 10 : 0817633286 ISBN 13 : 9780817633288
Langue: anglais
Vendeur : Bingo Books 2, Vancouver, WA, Etats-Unis
EUR 29,29
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierHardcover. Etat : Near Fine. hardback book in near fine conition.
EUR 59,11
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New. In.
EUR 68,22
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierEtat : 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.
EUR 58,39
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierTaschenbuch. 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.
EUR 68,22
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierEtat : Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
EUR 67,87
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierEtat : New. pp. 160.
EUR 68,37
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierEtat : New. pp. 160 23:B&W 6 x 9 in or 229 x 152 mm Perfect Bound on White w/Gloss Lam.
EUR 72,56
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierEtat : New. pp. 160.
EUR 75,30
Autre deviseQuantité disponible : 2 disponible(s)
Ajouter au panierHardcover. Etat : Brand New. 155 pages. 8.90x5.90x0.50 inches. In Stock.
EUR 86,65
Autre deviseQuantité disponible : 10 disponible(s)
Ajouter au panierPF. Etat : New.
EUR 51,72
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
EUR 101,45
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierPaperback. Etat : Very Good. Very Good. book.
Edité par Birkhauser Verlag AG, 1986
ISBN 10 : 3764333286 ISBN 13 : 9783764333287
Vendeur : GuthrieBooks, Spring Branch, TX, Etats-Unis
EUR 39,97
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierPaperback. Etat : Very Good. Ex-Library hardcover in very nice condition with all the usual markings and attachments. Text block clean and unmarked. Tight binding.
Vendeur : CONTINENTAL MEDIA & BEYOND, Ocala, FL, Etats-Unis
EUR 20,95
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierHardcover. Etat : Used: Good. former library 1986 hc no dj withdrawn stamp in book/ on edge of pages clean text No. 6 146 pages/// L-13.
EUR 60,65
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierEtat : 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.
EUR 60,65
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierEtat : Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
Vendeur : moluna, Greven, Allemagne
EUR 48,37
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierKartoniert / 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.
Edité par Birkhäuser Boston, Birkhäuser Boston Jan 1985, 1985
ISBN 10 : 0817633286 ISBN 13 : 9780817633288
Langue: anglais
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
EUR 53,49
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierTaschenbuch. 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.
Vendeur : THE SAINT BOOKSTORE, Southport, Royaume-Uni
EUR 66,94
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierPaperback / softback. Etat : New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 380.
Edité par Birkhäuser Boston Jan 1985, 1985
ISBN 10 : 0817633286 ISBN 13 : 9780817633288
Langue: anglais
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
EUR 85,59
Autre deviseQuantité disponible : 2 disponible(s)
Ajouter au panierTaschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - 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. 160 pp. Englisch.