541 search results - page 20 / 109 » An Efficient Algorithm for the Longest Pattern Subsequence P... |
AIHC
2007
Springer
14 years 3 months ago
2007
Springer
This work addresses the problem of human action recognition by introducing a representation of a human action as a collection of short trajectories that are extracted in areas of ...
DM
1999
13 years 8 months ago
1999
We examine powers of Hamiltonian paths and cycles as well as Hamiltonian (power) completion problems in several highly structured graph classes. For threshold graphs we give effic...
KDD
2004
ACM
14 years 9 months ago
2004
ACM
In recent years, various constrained frequent pattern mining problem formulations and associated algorithms have been developed that enable the user to specify various itemsetbase...
AIRS
2004
Springer
14 years 2 months ago
2004
Springer
There exist practical bit-parallel algorithms for several types of pair-wise string processing, such as longest common subsequence computation or approximate string matching. The b...
PKDD
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. Pattern-based classification has demonstrated its power in recent studies, but because the cost of mining discriminative patterns as features in classification is very ex...