144 search results - page 5 / 29 » Non-blocking binary search trees |
111
click to vote
ISCIS
2009
Springer
15 years 6 months ago
2009
Springer
—We propose an exhaustive search algorithm that calculates the VC-dimension of univariate decision trees with binary features. The VC-dimension of the univariate decision tree wi...
135
click to vote
DAGSTUHL
2007
15 years 2 months ago
2007
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...
131
click to vote
FSTTCS
2004
Springer
15 years 6 months 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
15 years 1 months ago
2002
Abstract. q
105
click to vote
SIAMCOMP
2002
15 years 1 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...