134 search results - page 12 / 27 » A Boyer-Moore Type Algorithm for Compressed Pattern Matching |
SSPR
2004
Springer
14 years 3 months ago
2004
Springer
Kernel Methods are a class of algorithms for pattern analysis with a number of convenient features. They can deal in a uniform way with a multitude of data types and can be used to...
ICFP
2009
ACM
14 years 11 months ago
2009
ACM
GADTs have proven to be an invaluable language extension, a.o. for ensuring data invariants and program correctness. Unfortunately, they pose a tough problem for type inference: w...
ANCS
2007
ACM
14 years 2 months ago
2007
ACM
Modern network intrusion detection systems need to perform regular expression matching at line rate in order to detect the occurrence of critical patterns in packet payloads. Whil...
PC
2007
13 years 10 months ago
2007
The Sony–Toshiba–IBM Cell Broadband Engine (Cell/B.E.) is a heterogeneous multicore architecture that consists of a traditional microprocessor (PPE) with eight SIMD co-process...
SIGIR
2002
ACM
13 years 10 months ago
2002
ACM
We present a novel sequential clustering algorithm which is motivated by the Information Bottleneck (IB) method. In contrast to the agglomerative IB algorithm, the new sequential ...