61 search results - page 5 / 13 » Vector Approximation based Indexing for High-Dimensional Mul... |
165
click to vote
SIGMOD
2008
ACM
15 years 9 months ago
2008
ACM
A method for approximate subsequence matching is introduced, that significantly improves the efficiency of subsequence matching in large time series data sets under the dynamic ti...
KDD
2001
ACM
15 years 9 months ago
2001
ACM
The problem of similarity search (query-by-content) has attracted much research interest. It is a difficult problem because of the inherently high dimensionality of the data. The ...
172
click to vote
VLDB
2007
ACM
15 years 9 months ago
2007
ACM
Similarity-based search over time-series databases has been a hot research topic for a long history, which is widely used in many applications, including multimedia retrieval, dat...
105
Voted
BIBE
2003
IEEE
15 years 2 months ago
2003
IEEE
We present a multi-dimensional indexing approach for fast sequence similarity search in DNA and protein databases. In particular, we propose effective transformations of subsequen...
67
Voted
IEEECIT
2005
IEEE
15 years 3 months ago
2005
IEEE
Similarity search leveraging distance-based index structures is increasingly being used for complex data types. It has been shown that for high dimensional uniform vectors with si...