2107 search results - page 284 / 422 » Computing Small Search Numbers in Linear Time |
129
click to vote
BTW
2007
Springer
15 years 8 months ago
2007
Springer
: Distributed top-k query processing is increasingly becoming an essential functionality in a large number of emerging application classes. This paper addresses the efficient alge...
124
click to vote
SPIRE
2010
Springer
15 years 28 days ago
2010
Springer
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
119
Voted
ICCV
1995
IEEE
15 years 6 months ago
1995
IEEE
A fast simulatedannealingalgorithmis developed for automatic object recognition. The object recognition problem is addressed as the problem of best describing a match between a hy...
116
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Bit arrays, or bitmaps, are used to significantly speed up set operations in several areas, such as data warehousing, information retrieval, and data mining, to cite a few. Howeve...
130
Voted
EGH
2003
Springer
15 years 7 months ago
2003
Springer
We present a novel approach for fast collision detection between multiple deformable and breakable objects in a large environment using graphics hardware. Our algorithm takes into...