Results 1  10
of
18,667
Regular Expression Searching on Compressed Text
 Journal of Discrete Algorithms
, 2003
"... We present a solution to the problem of regular expression searching on compressed text. ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
We present a solution to the problem of regular expression searching on compressed text.
Fast Regular Expression Search
, 1999
"... . We present a new algorithm to search regular expressions, which is able to skip text characters. The idea is to determine the minimum length ` of a string matching the regular expression, manipulate the original automaton so that it recognizes all the reverse prefixes of length up to ` of the stri ..."
Abstract

Cited by 15 (11 self)
 Add to MetaCart
. We present a new algorithm to search regular expressions, which is able to skip text characters. The idea is to determine the minimum length ` of a string matching the regular expression, manipulate the original automaton so that it recognizes all the reverse prefixes of length up
New techniques for regular expression searching
 Algorithmica
, 2005
"... We present two new techniques for regular expression searching and use them to derive faster practical algorithms. Based on the specific properties of Glushkov’s nondeterministic finite automaton construction algorithm, we show how to encode a deterministic finite automaton (DFA) using O(m2 m) bits, ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
We present two new techniques for regular expression searching and use them to derive faster practical algorithms. Based on the specific properties of Glushkov’s nondeterministic finite automaton construction algorithm, we show how to encode a deterministic finite automaton (DFA) using O(m2 m) bits
Compact DFA Representation for Fast Regular Expression Search
, 2001
"... . We present a new technique to encode a deterministic finite automaton (DFA). Based on the specific properties of Glushkov's nondeterministic finite automaton (NFA) construction algorithm, we are able to encode the DFA using (m + 1)(2 m+1 + j\Sigma j) bits, where m is the number of charact ..."
Abstract

Cited by 13 (6 self)
 Add to MetaCart
. Our approach is practical and simple to implement, and it permits searching regular expressions of moderate size (which include most cases of interest) faster than with any previously existing algorithm, as we show experimentally. 1
Approximate Regular Expression Searching with Arbitrary Integer Weights
 NORDIC JOURNAL OF COMPUTING
, 2003
"... We present a bitparallel technique to search a text of length n for a regular expression of m symbols permitting k differences in worst case time O(mn / log k s), where s is the amount of main memory that can be allocated. The algorithm permits arbitrary integer weights and matches the complexity ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
We present a bitparallel technique to search a text of length n for a regular expression of m symbols permitting k differences in worst case time O(mn / log k s), where s is the amount of main memory that can be allocated. The algorithm permits arbitrary integer weights and matches
Compact and Fast Algorithms for Regular Expression Search
 International Journal of Computer Mathematics (IJCM
, 2004
"... This paper describes an improvement of the brute force determinization algorithm in the case of homogeneous NFAs, as well as its application to pattern matching. Brute force determinization with limited memory may provide a partially determinized automaton, but its bounded complexity makes it be ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
This paper describes an improvement of the brute force determinization algorithm in the case of homogeneous NFAs, as well as its application to pattern matching. Brute force determinization with limited memory may provide a partially determinized automaton, but its bounded complexity makes it be a failsafe procedure contrary to the classical subset construction.
Regular expression searching over ZivLempel compressed text
 Proc. 12th Annual Symposium on Combinatorial Pattern Matching (CPM'2001), LNCS 2089
, 2001
"... We present a solution to the problem of regular expression searching on compressed text. The format we choose is the ZivLempel family, specifically the LZ78 and LZW variants. Given a text of length u compressed into length n, and a pattern of length m, we report all the R occurrences of the pattern ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
We present a solution to the problem of regular expression searching on compressed text. The format we choose is the ZivLempel family, specifically the LZ78 and LZW variants. Given a text of length u compressed into length n, and a pattern of length m, we report all the R occurrences
Automated Dynamic Reconfiguration for High Performance Regular Expression Searching
 in IEEE Int’l Conference on Field Programmable Technology
, 2009
"... AbstractDynamic reconfiguration can be necessary to produce fast and flexible FPGAbased applications. However, in practice very few developers actually use this capability. One reason for this is that it is very difficult to write and execute applications that are spread across multiple configura ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
configurations. This paper uses the problem of regular expression searching for email spam filtering to illustrate the potential advantages of dynamic reconfiguration and the inherent development problems associated with the conventional design methodology. To solve these problems, we present a regular
Memoryefficient regular expression search using state merging
 In Proc. of INFOCOM 2007
, 2007
"... Abstract — Pattern matching is a crucial task in several critical network services such as intrusion detection and policy management. As the complexity of rulesets increases, traditional string matching engines are being replaced by more sophisticated regular expression engines. To keep up with li ..."
Abstract

Cited by 25 (1 self)
 Add to MetaCart
Abstract — Pattern matching is a crucial task in several critical network services such as intrusion detection and policy management. As the complexity of rulesets increases, traditional string matching engines are being replaced by more sophisticated regular expression engines. To keep up
FIRE/J Optimizing Regular Expression Searches with Generative Programming
"... Regular expressions are a powerful tool for analyzing and manipulating text. Their theoretical background lies within automata theory and formal languages. The FIRE/J (Fast Implementation of Regular Expressions for Java) regular expression library is designed to provide maximum execution speed, whil ..."
Abstract
 Add to MetaCart
Regular expressions are a powerful tool for analyzing and manipulating text. Their theoretical background lies within automata theory and formal languages. The FIRE/J (Fast Implementation of Regular Expressions for Java) regular expression library is designed to provide maximum execution speed
Results 1  10
of
18,667