✦ LIBER ✦

Average case analysis of region search in balanced k-d trees

✍ Scribed by Y.V. Silva-Filho

Book ID: 113162117
Publisher: Elsevier Science
Year: 1979
Tongue: English
Weight: 564 KB
Volume: 8
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(79)90110-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Worst-case analysis for region and parti

Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees

✍ D. T. Lee; C. K. Wong 📂 Article 📅 1977 🏛 Springer-Verlag 🌐 English ⚖ 357 KB

Average-case analysis on simple families

Average-case analysis on simple families of trees using a balanced probability model

✍ R Casas; J Díaz; C Martínez 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 732 KB

Analysis of range search for random k-d

Analysis of range search for random k-d trees

✍ Philippe Chanzy; Luc Devroye; Carlos Zamora-Cura 📂 Article 📅 2001 🏛 Springer-Verlag 🌐 English ⚖ 254 KB

Optimal choice of discriminators in a ba

Optimal choice of discriminators in a balanced k-d binary search tree

✍ Ysmar V. Silva Filho 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 448 KB

Average Case Analysis of Searching in As

Average Case Analysis of Searching in Associative Processing

✍ Panagiotis E Nastou; Dimitrios N Serpanos; Dimitrios G Maritsas 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 804 KB

We introduce an average case analysis of the search primitive operations (equality and thresholding) in associative memories. We provide a general framework for analysis, using as parameters the word space distribution and the CAM size parameters: m (number of memory words) and n (memory word length

An analytic approach for the analysis of

An analytic approach for the analysis of rotations in fringe-balanced binary search trees

✍ Alois Panholzer; Helmut Prodinger 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 527 KB