Sciweavers

426 search results - page 19 / 86
» Run lengths and liquidity
Sort
View

Publication
308views
15 years 9 months ago
Measures for Classification and Detection in Steganalysis
Still and multi-media images are subject to transformations for compression, steganographic embedding and digital watermarking. In a major program of activities we are engaged in t...
Sujit Gujar, C E Veni Madhavan
DCC
2008
IEEE
14 years 9 months ago
A Simple Algorithm for Computing the Lempel Ziv Factorization
We give a space-efficient simple algorithm for computing the Lempel?Ziv factorization of a string. For a string of length n over an integer alphabet, it runs in O(n) time independ...
Maxime Crochemore, Lucian Ilie, W. F. Smyth
COCO
2007
Springer
126views Algorithms» more  COCO 2007»
14 years 4 months ago
On Derandomizing Probabilistic Sublinear-Time Algorithms
There exists a positive constant α < 1 such that for any function T(n) ≤ nα and for any problem L ∈ BPTIME(T(n)), there exists a deterministic algorithm running in poly(T...
Marius Zimand
RTAS
2010
IEEE
13 years 8 months ago
Selecting Server Parameters for Predictable Runtime Monitoring
—Application of runtime monitoring to maintain the health of an embedded real-time software system requires that anomalous behavior be detected within a bounded time while preser...
Haitao Zhu, Steve Goddard, Matthew B. Dwyer
SPIRE
2010
Springer
13 years 8 months ago
Fast Bit-Parallel Matching for Network and Regular Expressions
Abstract. In this paper, we extend the SHIFT-AND approach by BaezaYates and Gonnet (CACM 35(10), 1992) to the matching problem for network expressions, which are regular expression...
Yusaku Kaneta, Shin-ichi Minato, Hiroki Arimura