2 search results - page 1 / 1 » SPC-FA: synergic parallel compact finite automaton to accele... |
ANCS
2009
ACM
13 years 2 months ago
2009
ACM
Deterministic Finite Automaton (DFA) is well-known for its constant matching speed in worst case, and widely used in multistring matching, which is a critical technique in high pe...
GLOBECOM
2010
IEEE
13 years 2 months ago
2010
IEEE
Multi-string matching is a key technique for implementing network security applications like Network Intrusion Detection Systems (NIDS) and anti-virus scanners. Existing DFA-based ...