4137 search results - page 135 / 828 » On the number of matchings of a tree |
165
click to vote
RSA
2002
15 years 6 months ago
2002
We present three new algorithms for on-line multiple string matching allowing errors. These are extensions of previous algorithms that search for a single pattern. The average run...
164
click to vote
SPIRE
2010
Springer
15 years 4 months ago
2010
Springer
We consider string matching with variable length gaps. Given a string T and a pattern P consisting of strings separated by variable length gaps (arbitrary strings of length in a sp...
211
click to vote
MMAS
2011
Springer
14 years 9 months ago
2011
Springer
This paper introduces a new sweeping preconditioner for the iterative solution of the variable coefficient Helmholtz equation in two and three dimensions. The algorithms follow th...
208
click to vote
CPM
1999
Springer
15 years 10 months ago
1999
Springer
In this paper we focus on the problem of compressed pattern matching for the text compression using antidictionaries, which is a new compression scheme proposed recently by Crochem...
146
click to vote
CAINE
2008
15 years 8 months ago
2008
This paper describes an algorithm that pieces together 2D fragments of an object. Matching fragments of an object is useful for solving puzzles or reassembling archaeological frag...