29 search results - page 4 / 6 » Faster Proximity Searching in Metric Data |
ICIP
2002
IEEE
14 years 7 months ago
2002
IEEE
In this paper, we present a new algorithm for solving the block matching problem which is independent of image content and is faster than other full-search methods. The method emp...
KDD
2006
ACM
14 years 5 months ago
2006
ACM
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
NIPS
2004
13 years 6 months ago
2004
This paper concerns approximate nearest neighbor searching algorithms, which have become increasingly important, especially in high dimensional perception areas such as computer v...
EDBT
2000
ACM
13 years 9 months ago
2000
ACM
In this paper we present the Slim-tree, a dynamic tree for organizing metric datasets in pages of fixed size. The Slim-tree uses the "fat-factor" which provides a simple ...
SSDBM
2009
IEEE
14 years 5 days 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...