Sciweavers

127 search results - page 1 / 26
» Regular Expression Matching with Multi-Strings
Sort
View
SODA
2010
ACM
213views Algorithms» more  SODA 2010»
14 years 1 months ago
Regular Expression Matching with Multi-Strings
Regular expression matching is a key task (and often computational bottleneck) in a variety of software tools and applications. For instance, the standard grep and sed utilities, ...
Philip Bille, Mikkel Thorup
ARC
2011
Springer
270views Hardware» more  ARC 2011»
12 years 11 months ago
A Regular Expression Matching Circuit Based on a Decomposed Automaton
In this paper, we propose a regular expression matching circuit based on a decomposed automaton. To implement a regular expression matching circuit, first, we convert regular expr...
Hiroki Nakahara, Tsutomu Sasao, Munehiro Matsuura
MEMOCODE
2010
IEEE
13 years 2 months ago
A regular expression matching using non-deterministic finite automaton
Abstract--This paper shows an implementation of CANSCID (Combined Architecture for Stream Categorization and Intrusion Detection). To satisfy the required system throughput, the pa...
Hiroshi Nakahara, Tsutomu Sasao, Munehiro Matsuura
INFOCOM
2011
IEEE
12 years 8 months ago
Space-time tradeoff in regular expression matching with semi-deterministic finite automata
Abstract—Regular expression matching (REM) with nondeterministic finite automata (NFA) can be computationally expensive when a large number of patterns are matched concurrently....
Yi-Hua E. Yang, Viktor K. Prasanna
ICC
2011
IEEE
237views Communications» more  ICC 2011»
12 years 3 months ago
Reorganized and Compact DFA for Efficient Regular Expression Matching
—Regular expression matching has become a critical yet challenging technique in content-aware network processing, such as application identification and deep inspection. To meet ...
Kai Wang, Yaxuan Qi, Yibo Xue, Jun Li