25 search results - page 1 / 5 » A regular expression matching using non-deterministic finite... |
IPPS
2010
IEEE
13 years 2 months ago
2010
IEEE
Regular Expressions (RegExes) are widely used in various applications to identify strings of text. Their flexibility, however, increases the complexity of the detection system and ...
MEMOCODE
2010
IEEE
13 years 2 months ago
2010
IEEE
Abstract--This paper shows an implementation of CANSCID (Combined Architecture for Stream Categorization and Intrusion Detection). To satisfy the required system throughput, the pa...
PAAMS
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. Regular expressions, or simply regex, have been widely used as a powerful pattern matching and text extractor tool through decades. Although they provide a powerful and f...
IISWC
2008
IEEE
13 years 11 months ago
2008
IEEE
—High-speed content inspection of network traffic is an important new application area for programmable networking systems, and has recently led to several proposals for high-per...
INFOCOM
2011
IEEE
12 years 8 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....