250 search results - page 42 / 50 » A metric cache for similarity search |
VLDB
2007
ACM
14 years 1 months ago
2007
ACM
In this paper we observe that k-anonymizing a data set is strikingly similar to building a spatial index over the data set, so similar in fact that classical spatial indexing tech...
CIKM
2005
Springer
14 years 29 days ago
2005
Springer
We present data representations, distance measures and organizational structures for fast and efficient retrieval of similar shapes in image databases. Using the Hough Transform w...
SIGIR
2010
ACM
13 years 7 months ago
2010
ACM
We present a novel approach to query reformulation which combines syntactic and semantic information by means of generalized Levenshtein distance algorithms where the substitution...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Given a point set S and an unknown metric d on S, we study the problem of efficiently partitioning S into k clusters while querying few distances between the points. In our model ...
IEEECIT
2005
IEEE
14 years 1 months ago
2005
IEEE
Similarity search leveraging distance-based index structures is increasingly being used for complex data types. It has been shown that for high dimensional uniform vectors with si...