352 search results - page 6 / 71 » Fast Graph Pattern Matching |
LATIN
1998
Springer
15 years 4 months ago
1998
Springer
We address the problem of approximate string matching in two dimensions, that is, to nd a pattern of size m m in a text of size n n with at most k errors (substitutions, insertions...
CPM
2005
Springer
15 years 5 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...
110
click to vote
KDD
1997
ACM
15 years 3 months ago
1997
ACM
Theproblemof efficiently and accurately locating patterns of interest in massivetimeseries data sets is an important and non-trivial problemin a wide variety of applications, incl...
104
click to vote
ICASSP
2007
IEEE
15 years 3 months ago
2007
IEEE
Motion estimation is the most time-consuming subsystem in a video codec. Thus, more efficient methods of motion estimation should be investigated. Real video sequences usually exh...