338 search results - page 12 / 68 » Using pattern matching for tiling and packing problems |
86
Voted
ICAPR
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. In this contribution, a novel and robust, geometry-based grouping strategy is proposed. Repeated, planar patterns in special relative positions are detected. The grouping...
CPM
2007
Springer
15 years 3 months ago
2007
Springer
In the k-matches problem, we are given a pattern and a text, and for each text location, the desired output consists of all aligned matching characters if there are k or fewer of ...
KDD
1997
ACM
15 years 1 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...
ICANN
2005
Springer
15 years 3 months ago
2005
Springer
Two recently proposed approaches to recognize temporal patterns have been proposed by J¨ager with the so called Echo State Network (ESN) and by Maass with the so called Liquid Sta...
LATIN
1998
Springer
15 years 1 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...