144 search results - page 4 / 29 » A speculation-friendly binary search tree |
ISCIS
2009
Springer
15 years 4 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...
120
click to vote
DAGSTUHL
2007
15 years 1 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...
109
click to vote
PPOPP
2012
ACM
13 years 7 months ago
2012
ACM
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
113
click to vote
FSTTCS
2004
Springer
15 years 5 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
14 years 11 months ago
2002
Abstract. q