136 search results - page 1 / 28 » Greedy Regular Expression Matching |
ICALP
2004
Springer
13 years 10 months ago
2004
Springer
This paper studies the problem of matching sequences against regular expressions in order to produce structured values.
INFOCOM
2011
IEEE
12 years 9 months ago
2011
IEEE
Abstract—Regular expression matching (REM) with nondeterministic finite automata (NFA) can be computationally expensive when a large number of patterns are matched concurrently....
ANCS
2007
ACM
13 years 9 months ago
2007
ACM
Deep Payload Inspection systems like SNORT and BRO utilize regular expression for their rules due to their high expressibility and compactness. The SNORT IDS system uses the PCRE ...
CORR
2008
Springer
13 years 3 months ago
2008
Springer
CPM
1998
Springer
13 years 9 months ago
1998
Springer
While much work has been done on determining if a document or a line of a document contains an exact or approximate match to a regular expression, less e ort has been expended in ...