156 search results - page 9 / 32 » A Content-Addressable Network for Similarity Search in Metri... |
SSDBM
2009
IEEE
14 years 3 months ago
2009
IEEE
High-dimensional indexing has been very popularly used for performing similarity search over various data types such as multimedia (audio/image/video) databases, document collectio...
ADC
2003
Springer
14 years 1 months ago
2003
Springer
In this paper, we propose a new metric index, called M+ -tree, which is a tree dynamically organized for large datasets in metric spaces. The proposed M+ -tree takes full advantag...
SEBD
1997
13 years 10 months ago
1997
M-tree is a dynamic access method suitable to index generic “metric spaces”, where the function used to compute the distance between any two objects satisfies the positivity, ...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
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...
CIKM
2008
Springer
13 years 10 months ago
2008
Springer
Random projection (RP) is a common technique for dimensionality reduction under L2 norm for which many significant space embedding results have been demonstrated. However, many si...