2107 search results - page 92 / 422 » Computing Small Search Numbers in Linear Time |
136
Voted
ICDE
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract-- Classification hierarchies are trees where links codify the fact that a node lower in the hierarchy contains documents whose contents are more specific than those one le...
100
click to vote
ESA
2003
Springer
15 years 8 months ago
2003
Springer
We present a new finger search tree with O(1) worst-case update time and O(log log d) expected search time with high probability in the Random Access Machine (RAM) model of comput...
104
click to vote
ACCV
2010
Springer
14 years 10 months ago
2010
Springer
Estimating planar projective transform (homography) from a pair of images is a classical problem in computer vision. In this paper, we propose a novel algorithm for direct register...
153
Voted
HIPC
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. Linear scan register allocation is an attractive register allocation algorithm because of its simplicity and fast running time. However, it is generally felt that linear ...
115
Voted
RECOMB
2005
Springer
16 years 3 months ago
2005
Springer
Abstract. Recent studies demonstrating the existence of special non-coding "antisense" RNAs used in post-transcriptional gene regulation have received considerable attent...