Sciweavers

EMNLP
2009
13 years 10 months ago
Real-Word Spelling Correction using Google Web 1T 3-grams
We present a method for detecting and correcting multiple real-word spelling errors using the Google Web 1T 3-gram data set and a normalized and modified version of the Longest Co...
Aminul Islam, Diana Inkpen
IPPS
2010
IEEE
13 years 10 months ago
Scalable multi-pipeline architecture for high performance multi-pattern string matching
Multi-pattern string matching remains a major performance bottleneck in network intrusion detection and anti-virus systems for high-speed deep packet inspection (DPI). Although Aho...
Weirong Jiang, Yi-Hua Edward Yang, Viktor K. Prasa...
SIAMCOMP
1998
113views more  SIAMCOMP 1998»
14 years 6 days ago
Two-Dimensional Periodicity in Rectangular Arrays
Abstract. String matching is rich with a variety of algorithmic tools. In contrast, multidimensional matching has had a rather sparse set of techniques. This paper presents a new a...
Amihood Amir, Gary Benson
MTA
2000
104views more  MTA 2000»
14 years 10 days ago
Tune Retrieval in the Multimedia Library
Musical scores are traditionally retrieved by title, composer or subject classification. Just as multimedia computer systems increase the range of opportunities available for pres...
Rodger J. McNab, Lloyd A. Smith, Ian H. Witten, Cl...
IPL
2008
98views more  IPL 2008»
14 years 16 days ago
Bit-parallel string matching under Hamming distance in O(n[m/w]) worst case time
Given two strings, a pattern P of length m and a text T of length n over some alphabet , we consider the string matching problem under k mismatches. The well
Szymon Grabowski, Kimmo Fredriksson
CAL
2008
14 years 20 days ago
Pipelined Architecture for Multi-String Matching
We present a pipelined approach to hardware implementation of the Aho-Corasick (AC) algorithm for string matching called P-AC. By incorporating pipelined processing, the state grap...
Derek Chi-Wai Pao, Wei Lin, Bin Liu
FPGA
2008
ACM
161views FPGA» more  FPGA 2008»
14 years 2 months ago
Implementing high-speed string matching hardware for network intrusion detection systems
This paper presents high-throughput techniques for implementing FSM based string matching hardware on FPGAs. By taking advantage of the fact that string matching operations for di...
Atul Mahajan, Benfano Soewito, Sai K. Parsi, Ning ...
FPGA
2004
ACM
163views FPGA» more  FPGA 2004»
14 years 4 months ago
Time and area efficient pattern matching on FPGAs
Pattern matching for network security and intrusion detection demands exceptionally high performance. Much work has been done in this field, and yet there is still significant roo...
Zachary K. Baker, Viktor K. Prasanna
FCCM
2004
IEEE
163views VLSI» more  FCCM 2004»
14 years 4 months ago
Implementation Results of Bloom Filters for String Matching
Network Intrusion Detection and Prevention Systems (IDPS) use string matching to scan Internet packets for malicious content. Bloom filters offer a mechanism to search for a large...
Michael Attig, Sarang Dharmapurikar, John W. Lockw...
ASAP
2004
IEEE
185views Hardware» more  ASAP 2004»
14 years 4 months ago
Families of FPGA-Based Algorithms for Approximate String Matching
Dynamic programming for approximate string matching is a large family of different algorithms, which vary significantly in purpose, complexity, and hardware utilization. Many impl...
Tom Van Court, Martin C. Herbordt