64 search results - page 9 / 13 » Analysis of evolutionary algorithms for the longest common s... |
CPM
2009
Springer
14 years 1 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...
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 ...
DMIN
2006
13 years 8 months ago
2006
We present an application of bi-dimensional and heterogeneous time series clustering in order to resolve a Social Sciences issue. The dataset is the result of a survey involving mo...
AIRS
2004
Springer
14 years 23 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...