A sub-linear time string matching algorithm with Bloom filters acceleration: Design, Implementation and Evaluation
碩士 === 國立交通大學 === 資訊科學與工程研究所 === 94 === Many network security applications heavily rely on string matching to detect malicious intrusions, viruses, spam, and so on. A software-based implementation may not meet the performance requirement of high-speed applications due to intensive computation and fr...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2006
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/25684296002946637638 |