141 search results - page 5 / 29 » An Algorithm for Transformation of Finite Automata to Regula... |
INFOCOM
2011
IEEE
13 years 8 days 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
2009
ACM
13 years 6 months ago
2009
ACM
Although Regular Expressions (RegExes) have been widely used in network security applications, their inherent complexity often limits the total number of RegExes that can be detec...
LATIN
1992
Springer
14 years 19 days ago
1992
Springer
DLT
2008
13 years 10 months ago
2008
ANCS
2007
ACM
14 years 17 days ago
2007
ACM
Modern network intrusion detection systems need to perform regular expression matching at line rate in order to detect the occurrence of critical patterns in packet payloads. Whil...