541 search results - page 44 / 109 » An Efficient Algorithm for the Longest Pattern Subsequence P... |
RECOMB
2006
Springer
14 years 9 months ago
2006
Springer
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
GECCO
2006
Springer
14 years 12 days ago
2006
Springer
In this paper an evolutionary algorithm is used for evolving gaits in a walking biped robot controller. The focus is fast learning in a real-time environment. An incremental appro...
VLSISP
2002
13 years 8 months ago
2002
Dimensionality reduction is an important problem in pattern recognition. There is a tendency of using more and more features to improve the performance of classifiers. However, not...
CIKM
1998
Springer
14 years 1 months ago
1998
Springer
In this paper we present SPADE, a new algorithm for fast discovery of Sequential Patterns. The existing solutions to this problem make repeated database scans, and use complex has...
ICDE
2007
IEEE
14 years 10 months ago
2007
IEEE
The goal of this paper is to monitor numerical streams, and to find subsequences that are similar to a given query sequence, under the DTW (Dynamic Time Warping) distance. Applica...