147 search results - page 10 / 30 » Algorithms for Computing the Longest Parameterized Common Su... |
82
Voted
ICPR
2004
IEEE
15 years 10 months ago
2004
IEEE
A system is described that tracks moving objects in a video dataset so as to extract a representation of the objects' 3D trajectories. The system then finds hierarchical clus...
89
Voted
IPL
2008
14 years 9 months ago
2008
The longest common subsequence and sequence alignment problems have been studied extensively and they can be regarded as the relationship measurement between sequences. However, m...
81
Voted
ICPR
2010
IEEE
15 years 20 days ago
2010
IEEE
Abstract--In this paper, normalized SoP string-edit distances, taking into account all possible alignments between two sequences, are investigated. These normalized distances are v...
86
Voted
AIRS
2004
Springer
15 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...
SAC
2006
ACM
15 years 3 months ago
2006
ACM
Constraint-based mining techniques on sequence databases have been studied extensively the last few years and efficient algorithms enable to compute complete collections of patte...