1421 search results - page 51 / 285 » Algorithms for subsequence combinatorics |
139
click to vote
CBMS
2005
IEEE
15 years 8 months ago
2005
IEEE
In this work we introduce the new problem of finding time series discords. Time series discords are subsequences of longer time series that are maximally different to all the rest...
119
click to vote
ICDM
2005
IEEE
15 years 8 months ago
2005
IEEE
We consider the problem of elastic matching of time series. We propose an algorithm that determines a subsequence of a target time series that best matches a query series. In the ...
CPM
2007
Springer
15 years 9 months ago
2007
Springer
In this paper a deterministic algorithm for the length reduction problem is presented. This algorithm enables a new tool for performing fast convolution in sparse data. While the ...
116
click to vote
CPM
1999
Springer
15 years 7 months ago
1999
Springer
This paper examines some of the rich structure of the syntenic distance model of evolutionary distance, introduced by Ferretti et al. (1996). The syntenic distance between two gen...
COCOON
1998
Springer
15 years 7 months ago
1998
Springer
In this paper, we generalize the Ski-Rental Problem to the Bahncard Problem which is an online problem of practical relevance for all travelers. The Bahncard is a railway pass of t...