910 search results - page 32 / 182 » Detecting False Matches in String Matching Algorithms |
126
click to vote
CPM
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. The Knuth-Morris-Pratt (KMP) pattern-matching algorithm guarantees both independence from alphabet size and worst-case execution time linear in the pattern length; on the...
121
click to vote
ISVC
2009
Springer
15 years 9 months ago
2009
Springer
This paper presents a method for matching closed, 2D shapes (2D object silhouettes) that are represented as an ordered collection of shape contexts [1]. Matching is performed using...
219
Voted
FUN
2010
Springer
15 years 7 months ago
2010
Springer
Given a string s, the Parikh vector of s, denoted p(s), counts the multiplicity of each character in s. Searching for a match of Parikh vector q (a “jumbled string”) in the tex...
195
click to vote
SIGCOMM
2006
ACM
15 years 8 months ago
2006
ACM
There is a growing demand for network devices capable of examining the content of data packets in order to improve network security and provide application-specific services. Most...
208
click to vote
VLDB
2007
ACM
16 years 3 months ago
2007
ACM
Many applications need to solve the following problem of approximate string matching: from a collection of strings, how to find those similar to a given string, or the strings in ...