89 search results - page 5 / 18 » Indexing Metric Spaces with M-Tree |
BIBE
2003
IEEE
14 years 2 months ago
2003
IEEE
Hierarchical metric-space clustering methods have been commonly used to organize proteomes into taxonomies. Consequently, it is often anticipated that hierarchical clustering can ...
SISAP
2008
IEEE
14 years 3 months ago
2008
IEEE
Similarity search has been proved suitable for searching in very large collections of unstructured data objects. We are interested in efficient parallel query processing under si...
SISAP
2009
IEEE
14 years 3 months ago
2009
IEEE
—We introduce a novel metric space search data structure called EGNAT, which is fully dynamic and designed for secondary memory. The EGNAT is based on Brin’s GNAT static index,...
ICCS
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. The Evolutionary Geometric Near-neighbor Access Tree (EGNAT) is a recently proposed data structure that is suitable for indexing large collections of complex objects. It ...
ICPR
2010
IEEE
13 years 9 months ago
2010
IEEE
Abstract—Nearest Neighbour search is a widely used technique in Pattern Recognition. In order to speed up the search many indexing techniques have been proposed. However, most of...