910 search results - page 85 / 182 » Detecting False Matches in String Matching Algorithms |
107
click to vote
CPM
2004
Springer
15 years 7 months ago
2004
Springer
The problem of comparing two sequences A and B to determine their similarity is one of the fundamental problems in pattern matching. A challenging, basic variation of the sequence...
121
click to vote
ESWS
2006
Springer
15 years 6 months ago
2006
Springer
We present a new iterative algorithm for ontology mapping where we combine standard string distance metrics with a structural similarity measure that is based on a vector represent...
148
click to vote
CIIA
2009
15 years 4 months ago
2009
Vertical partition is an important technique in database design used to enhance performance in database systems. Vertical fragmentation is a combinatorial optimization problem that...
111
Voted
CVPR
2005
IEEE
16 years 5 months ago
2005
IEEE
We present a real-time method for detecting deformable surfaces, with no need whatsoever for a priori pose knowledge. Our method starts from a set of wide baseline point matches b...
122
click to vote
TCS
2008
15 years 3 months ago
2008
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...