We develop efficient dynamic programming algorithms for pattern matching with general gaps and character classes. We consider patterns of the form p0g(a0, b0)p1g(a1, b1) . . . pm-1...
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...
Andreas Turina, Tinne Tuytelaars, Theo Moons, Luc ...
Abstract. In the framework of possibility theory, a tool named `fuzzy pattern matching' (FPM) has been proposed in the eighties and since successfully used in flexible queryin...
We address the issue of compiling ML pattern matching to compact and efficient decisions trees. Traditionally, compilation to decision trees is optimized by (1) implementing decis...
This paper presents iNFAnt, a parallel engine for regular expression pattern matching. In contrast with traditional approaches, iNFAnt adopts non-deterministic automata, allowing ...