541 search results - page 32 / 109 » An Efficient Algorithm for the Longest Pattern Subsequence P... |
SDM
2008
SIAM
13 years 10 months ago
2008
SIAM
Sequential pattern mining first proposed by Agrawal and Srikant has received intensive research due to its wide range applicability in many real-life domains. Various improvements...
SIAMCOMP
2008
13 years 8 months ago
2008
In this paper we consider the capacitated vertex cover problem which is the variant of vertex cover where each node is allowed to cover a limited number of edges. We present an ef...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Artificial neural networks (ANNs) have been successfully applied to solve a variety of classification and function approximation problems. Although ANNs can generally predict bett...
PR
2011
13 years 3 months ago
2011
This paper introduces a simple Sum-over-Paths (SoP) formulation of string edit distances accounting for all possible alignments between two sequences, and extends related previous...
ICDE
2009
IEEE
14 years 10 months ago
2009
IEEE
Discovering non-trivial matching subsequences from two time series is very useful in synthesizing novel time series. This can be applied to applications such as motion synthesis wh...