Sciweavers

1862 search results - page 77 / 373
» Constrained pattern matching
Sort
View
JUCS
2010
130views more  JUCS 2010»
15 years 29 days ago
On the Linear Number of Matching Substrings
Abstract: We study the number of matching substrings in the pattern matching problem. In general, there can be a quadratic number of matching substrings in the size of a given text...
Yo-Sub Han
PR
2002
108views more  PR 2002»
15 years 2 months ago
On deformable models for visual pattern recognition
This paper reviews model-based methods for non-rigid shape recognition. These methods model, match and classify non-rigid shapes, which are generally problematic for conventationa...
Kwok-Wai Cheung, Dit-Yan Yeung, Roland T. Chin
BIRD
2008
Springer
119views Bioinformatics» more  BIRD 2008»
15 years 4 months ago
Implementation of a Swap Matching Algorithm Using a Graph Theoretic Model
The swap matching problem consists if finding a pattern in a text, while allowing for transpositions in the pattern. A new approach using a graph-theoretic model was presented in [...
Pavlos Antoniou, Costas S. Iliopoulos, Inuka Jayas...
149
Voted
DBPL
2007
Springer
158views Database» more  DBPL 2007»
15 years 6 months ago
Efficient Algorithms for the Tree Homeomorphism Problem
Tree pattern matching is a fundamental problem that has a wide range of applications in Web data management, XML processing, and selective data dissemination. In this paper we deve...
Michaela Götz, Christoph Koch, Wim Martens
120
Voted
LPAR
2004
Springer
15 years 8 months ago
Second-Order Matching via Explicit Substitutions
Abstract. Matching is a basic operation extensively used in computation. Second-order matching, in particular, provides an adequate environment for expressing program transformatio...
Flávio L. C. de Moura, Fairouz Kamareddine,...