134 search results - page 8 / 27 » A Boyer-Moore Type Algorithm for Compressed Pattern Matching |
JSS
2007
13 years 10 months ago
2007
A control flow trace captures the complete sequence of dynamically executed basic blocks and function calls. It is usually of very large size and therefore commonly stored in com...
STACS
2009
Springer
14 years 5 months ago
2009
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic-programming s...
SIGIR
1998
ACM
14 years 2 months ago
1998
ACM
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....
POPL
2006
ACM
14 years 10 months ago
2006
ACM
We propose a type system based on regular tree grammars, where algebraic datatypes are interpreted in a structural way. Thus, the same constructors can be reused for different typ...
ALENEX
2011
13 years 2 months ago
2011
This paper presents an algorithm for exact pattern matching based on a new type of Bloom filter that we call a feed-forward Bloom filter. Besides filtering the input corpus, a ...