24 search results - page 1 / 5 » Distances in random digital search trees |
71
Voted
ACTA
2006
14 years 10 months ago
2006
88
Voted
JAL
2002
14 years 10 months ago
2002
We take a multivariate view of digital search trees by studying the number of nodes of different types that may coexist in a bucket digital search tree as it grows under an arbitr...
DMTCS
2010
14 years 7 months ago
2010
116
click to vote
MMM
2011
Springer
14 years 1 months ago
2011
Springer
Abstract. Efficient nearest neighbor (NN) search techniques for highdimensional data are crucial to content-based image retrieval (CBIR). Traditional data structures (e.g., kd-tree...
SIAMCOMP
1998
14 years 9 months ago
1998
Random binary search trees, b-ary search trees, median-of-(2k+1) trees, quadtrees, simplex trees, tries, and digital search trees are special cases of random split trees. For these...