Sciweavers

199 search results - page 13 / 40
» Sequences of low arithmetical complexity
Sort
View
89
Voted
ICASSP
2011
IEEE
14 years 3 months ago
Efficient NLMS and RLS algorithms for a class of nonlinear filters using periodic input sequences
The paper discusses computationally efficient NLMS and RLS algorithms for a broad class of nonlinear filters using periodic input sequences. The class comprises all nonlinear ...
Alberto Carini, V. John Mathews, Giovanni L. Sicur...
ICALP
2007
Springer
15 years 5 months ago
Reconciling Data Compression and Kolmogorov Complexity
While data compression and Kolmogorov complexity are both about effective coding of words, the two settings differ in the following respect. A compression algorithm or compressor...
Laurent Bienvenu, Wolfgang Merkle
CORR
2006
Springer
71views Education» more  CORR 2006»
14 years 11 months ago
Wreath Products in Stream Cipher Design
The paper develops a novel approach to stream cipher design: Both the state update function and the output function of the corresponding pseudorandom generators are compositions of...
Vladimir Anashin
PRL
2002
128views more  PRL 2002»
14 years 11 months ago
Dynamic flies: a new pattern recognition tool applied to stereo sequence processing
The "fly algorithm" is a fast artificial evolution-based technique devised for the exploration of parameter space in pattern recognition applications. In the application...
Jean Louchet, Maud Guyon, Marie-Jeanne Lesot, Amin...
DCG
1998
53views more  DCG 1998»
14 years 11 months ago
Motion Planning in Environments with Low Obstacle Density
We present a simple and e cient paradigm for computing the exact solution of the motionplanning problem in environments with a low obstacle density. Such environments frequently o...
A. Frank van der Stappen, Mark H. Overmars, Mark d...