27 search results - page 2 / 6 » DAPSS: Exact Subsequence Matching for Data Streams |
KDD
2012
ACM
11 years 7 months ago
2012
ACM
Most time series data mining algorithms use similarity search as a core subroutine, and thus the time taken for similarity search is the bottleneck for virtually all time series d...
APBC
2004
13 years 6 months ago
2004
Protein structure prediction is considered to be the holy grail of bioinformatics. Ab initio and homology modelling are two important groups of methods used in protein structure p...
SIGMOD
2008
ACM
14 years 5 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...
PETRA
2009
ACM
13 years 11 months ago
2009
ACM
Event search is the problem of identifying events or activity of interest in a large database storing long sequences of activity. In this paper, our topic is the problem of identi...
IDA
2008
Springer
13 years 5 months ago
2008
Springer
Abstract. We address the problem of matching imperfectly documented schemas of data streams and large databases. Instancelevel schema matching algorithms identify likely correspond...