Sciweavers

910 search results - page 7 / 182
» Detecting False Matches in String Matching Algorithms
Sort
View
79
Voted
ACSC
2001
IEEE
15 years 3 months ago
Efficiency of Data Structures for Detecting Overlaps in Digital Documents
This paper analyses the efficiency of different data structures for detecting overlap in digital documents. Most existing approaches use some hash function to reduce the space req...
Krisztián Monostori, Arkady B. Zaslavsky, H...
GEOINFO
2007
15 years 1 months ago
Approximate String Matching for Geographic Names and Personal Names
The problem of matching strings allowing errors has recently gained importance, considering the increasing volume of online textual data. In geotechnologies, approximate string mat...
Clodoveu A. Davis, Emerson de Salles
96
Voted
FPL
2003
Springer
164views Hardware» more  FPL 2003»
15 years 4 months ago
Fast, Large-Scale String Match for a 10Gbps FPGA-Based Network Intrusion Detection System
Intrusion Detection Systems such as Snort scan incoming packets for evidence of security threats. The most computation-intensive part of these systems is a text search against hund...
Ioannis Sourdis, Dionisios N. Pnevmatikatos
JSAC
2006
172views more  JSAC 2006»
14 years 11 months ago
A Memory-Efficient Parallel String Matching Architecture for High-Speed Intrusion Detection
The ability to inspect both packet headers and payloads to identify attack signatures makes network intrusion detection system (NIDS) a promising approach to protect Internet syste...
Hongbin Lu, Kai Zheng, Bin Liu, Xin Zhang, Y. Liu
CPM
2005
Springer
206views Combinatorics» more  CPM 2005»
15 years 5 months ago
A Fast Algorithm for Approximate String Matching on Gene Sequences
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...
Zheng Liu, Xin Chen, James Borneman, Tao Jiang