2157 search results - page 300 / 432 » Optimal Fast Hashing |
126
click to vote
ACCV
2010
Springer
15 years 4 months ago
2010
Springer
ACCV
In this paper we propose a novel approach to binocular stereo for fast matching of high-resolution images. Our approach builds a prior on the disparities by forming a ...
118
click to vote
CG
2007
Springer
15 years 3 months ago
2007
Springer
We present an efficient compression scheme for animated sequences of triangular meshes of the same connectivity. The proposed algorithm exploits the temporal coherence of the geo...
104
click to vote
IJFCS
2006
15 years 3 months ago
2006
Dynamically reconfigurable architectures offer extremely fast solutions to various problems. The Circuit Switched Tree (CST) is an important interconnect used to implement such ar...
116
click to vote
JGTOOLS
2008
15 years 3 months ago
2008
Hierarchical spatial data structures provide a means for organizing data for efficient processing. Most spatial data structures are optimized for performing queries, such as inters...
122
click to vote
EOR
2007
15 years 3 months ago
2007
Consider a single machine and a set of jobs that are available for processing at time 0. Job ¡ has a processing time ¢¤£ , a due date ¥¦£ and a weight §¨£ . We consid...