32 search results - page 6 / 7 » Semi-local longest common subsequences in subquadratic time |
AIHC
2007
Springer
14 years 1 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 ...
CPM
2009
Springer
14 years 2 months ago
2009
Springer
A classical measure of similarity between strings is the length of the longest common subsequence(LCS) between the two given strings. The search for efficient algorithms for findi...
AIRS
2004
Springer
14 years 25 days 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...
WOB
2004
13 years 8 months ago
2004
ABSTRACT. Reconfigurable systolic arrays can be adapted to efficiently resolve a wide spectrum of computational problems; parallelism is naturally explored in systolic arrays and r...
KDD
2003
ACM
14 years 7 months ago
2003
ACM
Although most time-series data mining research has concentrated on providing solutions for a single distance function, in this work we motivate the need for a single index structu...