473 search results - page 11 / 95 » Heapable Sequences and Subsequences |
97
Voted
SIGMOD
2005
ACM
15 years 10 months ago
2005
ACM
We study a problem of mining frequently occurring periodic patterns with a gap requirement from sequences. Given a character sequence S of length L and a pattern P of length l, we...
SARA
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. The presence of long gaps dramatically increases the difficulty of detecting and characterizing complex events hidden in long sequences. In order to cope with this proble...
73
Voted
CORR
2002
Springer
14 years 10 months ago
2002
Springer
an abstract optimization problem arising from biomolecular sequence analysis. For a sequence A of pairs (ai, wi) for i = 1, . . . , n and wi > 0, a segment A(i, j) is a consecu...
DM
1998
14 years 9 months ago
1998
One class of Davenport-Schinzel sequences consists of finite sequences over n symbols without immediate repetitions and without any subsequence of the type abab. We present a bij...
90
Voted
MMM
2005
Springer
15 years 3 months ago
2005
Springer
In this paper, we propose a new algorithm to find video clips with different temporal durations and some spatial variations. We adopt a longest common subsequence (LCS) matching t...