Sciweavers

58 search results - page 1 / 12
» Implementation and Application of Automata in String Process...
Sort
View
GLOBECOM
2010
IEEE
13 years 2 months ago
Independent Parallel Compact Finite Automatons for Accelerating Multi-String Matching
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 ...
Yi Tang, Junchen Jiang, Xiaofei Wang, Bin Liu, Yan...
APL
1995
ACM
13 years 8 months ago
Infix, Cut and Finite Automata
The behavior of one and two dimensional automata are displayed in two and three dimensions and via animations. Implementations of finite automata in J using "infix" and ...
Clifford A. Reiter
WIA
2000
Springer
13 years 8 months ago
Fast Implementations of Automata Computations
Abstract. In 6], G. Myers describes a bit-vector algorithm to compute the edit distance between strings. The algorithm converts an input sequence to an output sequence in a paralle...
Anne Bergeron, Sylvie Hamel
MAM
2008
150views more  MAM 2008»
13 years 4 months ago
FPGA based string matching for network processing applications
String matching is a key problem in many network processing applications. Current implementations of this process using software are time consuming and cannot meet gigabit bandwid...
Janardhan Singaraju, John A. Chandy