161 search results - page 6 / 33 » Skewed Binary Search Trees |
FSTTCS
2004
Springer
14 years 24 days ago
2004
Springer
We show how any BSP tree TP for the endpoints of a set of n disjoint segments in the plane can be used to obtain a BSP tree of size O(n · depth(TP )) for the segments themselves, ...
DMTCS
2002
13 years 7 months ago
2002
Abstract. q
SIAMCOMP
2002
13 years 7 months ago
2002
We consider sums of functions of subtrees of a random binary search tree, and obtain general laws of large numbers and central limit theorems. These sums correspond to random recur...
ALGORITHMICA
2011
13 years 2 months ago
2011
We consider the problem of computing efficient strategies for searching in trees. As a generalization of the classical binary search for ordered lists, suppose one wishes to find...
CVPR
2000
IEEE
14 years 9 months ago
2000
IEEE
Classifying an unknown input is a fundamental problem in Pattern Recognition. One standard method is finding its nearest neighbors in a reference set. It would be very time consum...