Sciweavers

331 search results - page 16 / 67
» Fast Matching for All Pairs Similarity Search
Sort
View
PAMI
2007
187views more  PAMI 2007»
14 years 9 months ago
Registration of Challenging Image Pairs: Initialization, Estimation, and Decision
—Our goal is an automated 2D-image-pair registration algorithm capable of aligning images taken of a wide variety of natural and man-made scenes as well as many medical images. T...
Gehua Yang, Charles V. Stewart, Michal Sofka, Chia...
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
15 years 1 months ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Gene Myers
WWW
2005
ACM
15 years 10 months ago
LSH forest: self-tuning indexes for similarity search
We consider the problem of indexing high-dimensional data for answering (approximate) similarity-search queries. Similarity indexes prove to be important in a wide variety of sett...
Mayank Bawa, Tyson Condie, Prasanna Ganesan
IBPRIA
2009
Springer
15 years 2 months ago
Large Scale Online Learning of Image Similarity through Ranking
ent abstract presents OASIS, an Online Algorithm for Scalable Image Similarity learning that learns a bilinear similarity measure over sparse representations. OASIS is an online du...
Gal Chechik, Varun Sharma, Uri Shalit, Samy Bengio
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
15 years 2 months ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...