Sciweavers

4616 search results - page 924 / 924
» The Communication Complexity of Correlation
Sort
View
ANCS
2009
ACM
13 years 3 months ago
LaFA: lookahead finite automata for scalable regular expression detection
Although Regular Expressions (RegExes) have been widely used in network security applications, their inherent complexity often limits the total number of RegExes that can be detec...
Masanori Bando, N. Sertac Artan, H. Jonathan Chao