144 search results - page 9 / 29 » A speculation-friendly binary search tree |
CPC
2002
13 years 7 months ago
2002
The Wiener index is analyzed for random recursive trees and random binary search trees in the uniform probabilistic models. We obtain the expectations, asymptotics for the varianc...
VLDB
1999
ACM
13 years 12 months ago
1999
ACM
As random access memory gets cheaper, it becomes increasingly affordable to build computers with large main memories. We consider decision support workloads within the context of...
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
AAAI
1996
13 years 9 months ago
1996
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...
ICIP
2004
IEEE
14 years 9 months ago
2004
IEEE
This paper presents an object recognition method that exploits the representation of the images obtained by means of a Binary Partition Tree (BPT). The shape matching technique in...