๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Analysis of range search for random k-d trees

โœ Scribed by Philippe Chanzy; Luc Devroye; Carlos Zamora-Cura

Publisher
Springer-Verlag
Year
2001
Tongue
English
Weight
254 KB
Volume
37
Category
Article
ISSN
0001-5903

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the complexity of branch-and-bound se
On the complexity of branch-and-bound search for random trees
โœ Luc Devroye; Carlos Zamora-Cura ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 256 KB ๐Ÿ‘ 2 views

Let T be a b-ary tree of height n, which has independent, non-negative, n identically distributed random variables associated with each of its edges, a model previously considered by Karp, Pearl, McDiarmid, and Provan. The value of a node is the sum of all the edge values on its path to the root. Co