Sciweavers

35 search results - page 5 / 7
» LZW Based Compressed Pattern Matching
Sort
View
TCAD
2008
201views more  TCAD 2008»
13 years 6 months ago
Bitmask-Based Code Compression for Embedded Systems
Embedded systems are constrained by the available memory. Code-compression techniques address this issue by reducing the code size of application programs. It is a major challenge ...
Seok-Won Seong, Prabhat Mishra
ALMOB
2006
102views more  ALMOB 2006»
13 years 6 months ago
Mining, compressing and classifying with extensible motifs
Background: Motif patterns of maximal saturation emerged originally in contexts of pattern discovery in biomolecular sequences and have recently proven a valuable notion also in t...
Alberto Apostolico, Matteo Comin, Laxmi Parida
IPPS
2010
IEEE
13 years 4 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...
IISWC
2008
IEEE
14 years 1 months ago
A workload for evaluating deep packet inspection architectures
—High-speed content inspection of network traffic is an important new application area for programmable networking systems, and has recently led to several proposals for high-per...
Michela Becchi, Mark A. Franklin, Patrick Crowley
WSDM
2009
ACM
187views Data Mining» more  WSDM 2009»
14 years 1 months ago
Speeding up algorithms on compressed web graphs
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
Chinmay Karande, Kumar Chellapilla, Reid Andersen