54 search results - page 2 / 11 » Pattern Matching for Case Analysis: A Computational Definiti... |
SODA
2003
ACM
13 years 5 months ago
2003
ACM
The subject of this paper are algorithms for measuring the similarity of patterns of line segments in the plane, a standard problem in, e.g., computer vision, geographic informati...
GECCO
2007
Springer
13 years 10 months ago
2007
Springer
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
CPM
2009
Springer
13 years 11 months ago
2009
Springer
A sequence of reversals that takes a signed permutation to the identity is perfect if it preserves all common intervals between the permutation and the identity. The problem of com...
GI
2009
Springer
13 years 2 months ago
2009
Springer
: The task of tracking extended objects or (partly) unresolvable group targets raises new challenges for both data association and track maintenance. Due to limited sensor resoluti...
STACS
1992
Springer
13 years 8 months ago
1992
Springer
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...