Sciweavers

250 search results - page 17 / 50
» A metric cache for similarity search
Sort
View
SIGMOD
2006
ACM
127views Database» more  SIGMOD 2006»
16 years 6 months ago
Efficient reverse k-nearest neighbor search in arbitrary metric spaces
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
Elke Achtert, Christian Böhm, Peer Kröge...
CORR
2010
Springer
249views Education» more  CORR 2010»
15 years 6 months ago
Lower Bounds on Near Neighbor Search via Metric Expansion
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
Rina Panigrahy, Kunal Talwar, Udi Wieder
DATESO
2010
153views Database» more  DATESO 2010»
15 years 4 months ago
Answering Metric Skyline Queries by PM-tree
Abstract. The task of similarity search in multimedia databases is usually accomplished by range or k nearest neighbor queries. However, the expressing power of these "single-...
Tomás Skopal, Jakub Lokoc
MMM
2011
Springer
251views Multimedia» more  MMM 2011»
14 years 9 months ago
Randomly Projected KD-Trees with Distance Metric Learning for Image Retrieval
Abstract. Efficient nearest neighbor (NN) search techniques for highdimensional data are crucial to content-based image retrieval (CBIR). Traditional data structures (e.g., kd-tree...
Pengcheng Wu, Steven C. H. Hoi, Duc Dung Nguyen, Y...
CIKM
2011
Springer
14 years 6 months ago
Effective retrieval of resources in folksonomies using a new tag similarity measure
Social (or folksonomic) tagging has become a very popular way to describe content within Web 2.0 websites. However, as tags are informally defined, continually changing, and ungo...
Giovanni Quattrone, Licia Capra, Pasquale De Meo, ...