SISAP
2008
IEEE
13 years 11 months ago
2008
IEEE
SISAP
2008
IEEE
13 years 11 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 11 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 11 months ago
2008
IEEE
All pivot-based algorithms for similarity search use a set of reference points called pivots. The pivot-based search algorithm precomputes some distances to these reference points...
SISAP
2008
IEEE
13 years 11 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 11 months ago
2008
IEEE
Many contemporary database applications require similarity-based retrieval of complex objects where the only usable knowledge of its domain is determined by a metric distance func...
SISAP
2008
IEEE
13 years 11 months ago
2008
IEEE
SISAP
2008
IEEE
13 years 11 months ago
2008
IEEE
SISAP
2008
IEEE
13 years 11 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 11 months ago
2008
IEEE
There are several pieces of information that can be utilized in order to improve the efficiency of similarity searches on high-dimensional data. The most commonly used information...