Sciweavers

233 search results - page 17 / 47
» An Investigation of Practical Approximate Nearest Neighbor A...
Sort
View
134
Voted
CVPR
2004
IEEE
16 years 2 months ago
Fast Contour Matching Using Approximate Earth Mover's Distance
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
Kristen Grauman, Trevor Darrell
136
Voted
STOC
2002
ACM
177views Algorithms» more  STOC 2002»
16 years 20 days ago
Similarity estimation techniques from rounding algorithms
A locality sensitive hashing scheme is a distribution on a family F of hash functions operating on a collection of objects, such that for two objects x, y, PrhF [h(x) = h(y)] = si...
Moses Charikar
198
Voted
GIS
2007
ACM
16 years 1 months ago
Approximate order-k Voronoi cells over positional streams
Handling streams of positional updates from numerous moving objects has become a challenging task for many monitoring applications. Several algorithms have been recently proposed ...
Kostas Patroumpas, Theofanis Minogiannis, Timos K....
95
Voted
SISAP
2008
IEEE
175views Data Mining» more  SISAP 2008»
15 years 6 months ago
Anytime K-Nearest Neighbor Search for Database Applications
Many contemporary database applications require similarity-based retrieval of complex objects where the only usable knowledge of its domain is determined by a metric distance func...
Weijia Xu, Daniel P. Miranker, Rui Mao, Smriti R. ...
ICDE
2010
IEEE
282views Database» more  ICDE 2010»
16 years 4 days ago
Quantile-Based KNN Over Multi-Valued Objects
K Nearest Neighbor search has many applications including data mining, multi-media, image processing, and monitoring moving objects. In this paper, we study the problem of KNN over...
Wenjie Zhang, Xuemin Lin, Muhammad Aamir Cheema, Y...