138 search results - page 5 / 28 » Finding an optimal tree searching strategy in linear time |
FOCS
2006
IEEE
14 years 4 months ago
2006
IEEE
We extend the binary search technique to searching in trees. We consider two models of queries: questions about vertices and questions about edges. We present a general approach t...
AMDO
2010
Springer
13 years 7 months ago
2010
Springer
This paper proposes a method of rate-distortion optimisation of an algorithm for compressing dynamic 3D triangle meshes. Although many articles regarding compression methods for th...
ALGORITHMICA
2000
13 years 10 months ago
2000
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
SIAMCOMP
2002
13 years 10 months ago
2002
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...
WABI
2001
Springer
14 years 2 months ago
2001
Springer
We derive a branch-and-bound algorithm to find an optimal inversion median of three signed permutations. The algorithm prunes to manageable size an extremely large search tree usi...