13 search results - page 2 / 3 » sisap 2008 |
SISAP
2008
IEEE
13 years 12 months ago
2008
IEEE
In this article, we review the major paradigms for approximate similarity queries and propose a classification schema that easily allows existing approaches to be compared along ...
SISAP
2008
IEEE
13 years 12 months ago
2008
IEEE
Distance permutation indexes support fast proximity searching in high-dimensional metric spaces. Given some fixed reference sites, for each point in a database the index stores a...
SISAP
2008
IEEE
13 years 12 months ago
2008
IEEE
Similarity search in sequence databases is of paramount importance in bioinformatics research. As the size of the genomic databases increases, similarity search of proteins in the...
SISAP
2008
IEEE
13 years 12 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
2008
IEEE
13 years 12 months ago
2008
IEEE
In this paper we introduce a new M-tree building method, utilizing the classic idea of forced reinsertions. In case a leaf is about to split, some distant objects are removed from...