Sciweavers

120 search results - page 21 / 24
» Complementary Hashing for Approximate Nearest Neighbor Searc...
Sort
View
129
Voted
COMPGEOM
2010
ACM
15 years 2 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
CVPR
2005
IEEE
15 years 11 months ago
Efficient Image Matching with Distributions of Local Invariant Features
Sets of local features that are invariant to common image transformations are an effective representation to use when comparing images; current methods typically judge feature set...
Kristen Grauman, Trevor Darrell
ICDAR
2011
IEEE
13 years 9 months ago
Fast Key-Word Searching via Embedding and Active-DTW
—In this paper we present a novel approach for fast search of handwritten Arabic word-parts within large lexicons. The algorithm runs through three steps to achieve the required ...
Raid Saabni, Alex Bronstein
BIBE
2003
IEEE
183views Bioinformatics» more  BIBE 2003»
15 years 2 months ago
Effective Indexing and Filtering for Similarity Search in Large Biosequence Databases
We present a multi-dimensional indexing approach for fast sequence similarity search in DNA and protein databases. In particular, we propose effective transformations of subsequen...
Ozgur Ozturk, Hakan Ferhatosmanoglu
DAGM
2009
Springer
15 years 4 months ago
Markerless 3D Face Tracking
We present a novel algorithm for the markerless tracking of deforming surfaces such as faces. We acquire a sequence of 3D scans along with color images at 40Hz. The data is then re...
Christian Walder, Martin Breidt, Heinrich H. B&uum...