910 search results - page 18 / 182 » Detecting False Matches in String Matching Algorithms |
85
Voted
MFCS
2005
Springer
15 years 8 months ago
2005
Springer
The online squarefree recognition problem is to detect the first occurrence of a square in a string whose characters are provided as input one at a time. We present an efficient a...
124
Voted
CIKM
2001
Springer
15 years 7 months ago
2001
Springer
Many document-based applications, including popular Web browsers, email viewers, and word processors, have a ‘Find on this Page’ feature that allows a user to find every occur...
104
Voted
WEA
2007
Springer
15 years 9 months ago
2007
Springer
Given a sequence S of n symbols over some alphabet Σ, we develop a new compression method that is (i) very simple to implement; (ii) provides O(1) time random access to any symbol...
103
Voted
ICPR
2002
IEEE
16 years 3 months ago
2002
IEEE
A method for measuring dissimilarities between cyclic strings is introduced. It computes a weighted mean between two (lower and upper) bounds of the exact cyclic edit distance, wh...
207
click to vote
CVPR
2009
IEEE
16 years 10 months ago
2009
IEEE
This paper introduces a new shape matching algorithm for computing correspondences between 3D surfaces that have undergone (approximately) isometric deformations. The new approach ...