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...
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...
Abstract. The actor model provides high-level concurrency abstractions to coordinate simultaneous computations by message passing. Languages implementing the actor model such as Er...
Martin Sulzmann, Edmund S. L. Lam, Peter Van Weert
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...
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...