116 search results - page 5 / 24 » Deep packet anonymization |
ANCS
2007
ACM
13 years 11 months ago
2007
ACM
CONEXT
2007
ACM
13 years 11 months ago
2007
ACM
Deterministic finite automata (DFAs) are widely used to perform regular expression matching in linear time. Several techniques have been proposed to compress DFAs in order to redu...
COMPUTER
2008
13 years 6 months ago
2008
GLOBECOM
2010
IEEE
13 years 5 months ago
2010
IEEE
Abstract--Regular expression (Regex) becomes the standard signature language for security and application detection. Deterministic finite automata (DFAs) are widely used to perform...
TON
2012
11 years 10 months ago
2012
—Regular expressions (RegExes) are widely used, yet their inherent complexity often limits the total number of RegExes that can be detected using a single chip for a reasonable t...