227 search results - page 14 / 46 » Dimensionality Reduction for Similarity Searching in Dynamic... |
VLDB
2004
ACM
15 years 2 months ago
2004
ACM
Given a point q, a reverse k nearest neighbor (RkNN) query retrieves all the data points that have q as one of their k nearest neighbors. Existing methods for processing such quer...
BMCBI
2008
14 years 9 months ago
2008
Background: Similarity inference, one of the main bioinformatics tasks, has to face an exponential growth of the biological data. A classical approach used to cope with this data ...
243
click to vote
ICDAR
2011
IEEE
13 years 9 months ago
2011
IEEE
—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 ...
EDBT
2009
ACM
15 years 4 months ago
2009
ACM
In this paper we consider distributed K-Nearest Neighbor (KNN) search and range query processing in high dimensional data. Our approach is based on Locality Sensitive Hashing (LSH...
88
Voted
EUROSYS
2006
ACM
15 years 6 months ago
2006
ACM
Building content-based search tools for feature-rich data has been a challenging problem because feature-rich data such as audio recordings, digital images, and sensor data are in...