Sciweavers

99 search results - page 11 / 20
» Speeding Up Pattern Matching by Text Compression
Sort
View
CPM
2005
Springer
100views Combinatorics» more  CPM 2005»
14 years 11 months ago
Hardness of Optimal Spaced Seed Design
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
François Nicolas, Eric Rivals
74
Voted
FPL
2009
Springer
100views Hardware» more  FPL 2009»
15 years 1 months ago
A virus scanning engine using a parallel finite-input memory machine and MPUs
This paper presents a virus scanning engine. After showing the difference between ClamAV (an anti-virus software) and SNORT (an intrusion detection software), we show a new archit...
Hiroki Nakahara, Tsutomu Sasao, Munehiro Matsuura,...
TVLSI
2010
14 years 4 months ago
Test Data Compression Using Efficient Bitmask and Dictionary Selection Methods
Abstract--Higher circuit densities in system-on-chip (SOC) designs have led to drastic increase in test data volume. Larger test data size demands not only higher memory requiremen...
Kanad Basu, Prabhat Mishra
CIARP
2010
Springer
14 years 8 months ago
Improving the Dynamic Hierarchical Compact Clustering Algorithm by Using Feature Selection
Abstract. Feature selection has improved the performance of text clustering. In this paper, a local feature selection technique is incorporated in the dynamic hierarchical compact ...
Reynaldo Gil-García, Aurora Pons-Porrata
RAID
2009
Springer
15 years 4 months ago
Multi-byte Regular Expression Matching with Speculation
Intrusion prevention systems determine whether incoming traffic matches a database of signatures, where each signature in the database represents an attack or a vulnerability. IPSs...
Daniel Luchaup, Randy Smith, Cristian Estan, Somes...