96 search results - page 2 / 20 » Restructuring ordered binary trees |
FOCS
2006
IEEE
13 years 11 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...
ICASSP
2011
IEEE
12 years 9 months ago
2011
IEEE
This paper proposes a system to relate objects in an image using occlusion cues and arrange them according to depth. The system does not rely on any a priori knowledge of the scen...
ICIP
2010
IEEE
13 years 3 months ago
2010
IEEE
Hyperspectral imaging segmentation has been an active research area over the past few years. Despite the growing interest, some factors such as high spectrum variability are still...
PPOPP
2012
ACM
12 years 28 days 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...
ICPP
1993
IEEE
13 years 9 months ago
1993
IEEE
We describe three new Jacobi orderings for parallel computation of SVD problems on tree architectures. The rst ordering uses the high bandwidth of a perfect binary fat-tree to min...