Sciweavers

68 search results - page 6 / 14
» Distributed similarity search in high dimensions using local...
Sort
View
DSMML
2004
Springer
15 years 5 months ago
Redundant Bit Vectors for Quickly Searching High-Dimensional Regions
Applications such as audio fingerprinting require search in high dimensions: find an item in a database that is similar to a query. An important property of this search task is t...
Jonathan Goldstein, John C. Platt, Christopher J. ...
ACCV
2007
Springer
15 years 3 months ago
Efficient Search in Document Image Collections
This paper presents an efficient indexing and retrieval scheme for searching in document image databases. In many non-European languages, optical character recognizers are not very...
Anand Kumar 0002, C. V. Jawahar, R. Manmatha
SIGMOD
2012
ACM
209views Database» more  SIGMOD 2012»
13 years 2 months ago
Locality-sensitive hashing scheme based on dynamic collision counting
Locality-Sensitive Hashing (LSH) and its variants are wellknown methods for solving the c-approximate NN Search problem in high-dimensional space. Traditionally, several LSH funct...
Junhao Gan, Jianlin Feng, Qiong Fang, Wilfred Ng
RECOMB
2004
Springer
16 years 1 days ago
Designing multiple simultaneous seeds for DNA similarity search
The challenge of similarity search in massive DNA sequence databases has inspired major changes in BLAST-style alignment tools, which accelerate search by inspecting only pairs of...
Yanni Sun, Jeremy Buhler
AAAI
2008
15 years 2 months ago
Dimension Amnesic Pyramid Match Kernel
With the success of local features in object recognition, feature-set representations are widely used in computer vision and related domains. Pyramid match kernel (PMK) is an effi...
Yi Liu, Xulei Wang, Hongbin Zha