Sciweavers

170 search results - page 22 / 34
» Algorithms on Compressed Strings and Arrays
Sort
View
ANCS
2007
ACM
15 years 1 months ago
An improved algorithm to accelerate regular expression evaluation
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...
Michela Becchi, Patrick Crowley
ESTIMEDIA
2007
Springer
15 years 1 months ago
Still Image Processing on Coarse-Grained Reconfigurable Array Architectures
Due to the increasing demands on efficiency, performance and flexibility reconfigurable computational architectures are very promising candidates in embedded systems design. Recent...
Matthias Hartmann, Vasileios (Vassilis) Pantazis, ...
70
Voted
AAECC
1990
Springer
100views Algorithms» more  AAECC 1990»
15 years 1 months ago
Duality between Two Cryptographic Primitives
This paper reveals a duality between constructions of two basic cryptographic primitives, pseudo-random string generators and one-way hash functions. Applying the duality, we pres...
Yuliang Zheng, Tsutomu Matsumoto, Hideki Imai
CSR
2006
Springer
15 years 1 months ago
Window Subsequence Problems for Compressed Texts
Given two strings (a text t of length n and a pattern p) and a natural number w, window subsequence problems consist in deciding whether p occurs as a subsequence of t and/or findi...
Patrick Cégielski, Irène Guessarian,...
70
Voted
DCC
2006
IEEE
15 years 9 months ago
Compression and Machine Learning: A New Perspective on Feature Space Vectors
The use of compression algorithms in machine learning tasks such as clustering and classification has appeared in a variety of fields, sometimes with the promise of reducing probl...
D. Sculley, Carla E. Brodley