Sciweavers

51 search results - page 5 / 11
» Observation Reduction for Strong Plans
Sort
View
CRYPTO
2011
Springer
191views Cryptology» more  CRYPTO 2011»
12 years 7 months ago
Analyzing Blockwise Lattice Algorithms Using Dynamical Systems
Strong lattice reduction is the key element for most attacks against lattice-based cryptosystems. Between the strongest but impractical HKZ reduction and the weak but fast LLL redu...
Guillaume Hanrot, Xavier Pujol, Damien Stehl&eacut...
IACR
2011
155views more  IACR 2011»
12 years 7 months ago
Terminating BKZ
Strong lattice reduction is the key element for most attacks against lattice-based cryptosystems. Between the strongest but impractical HKZ reduction and the weak but fast LLL redu...
Guillaume Hanrot, Xavier Pujol, Damien Stehl&eacut...
ICIP
2000
IEEE
14 years 9 months ago
Integrated Compression and Linear Feature Detection in the Wavelet Domain
In many Earth observation missions, a large amount of data is collected by the on-board sensors, and must be transmitted to ground through a channel with limited capacity; in this...
Enrico Magli, Gabriella Olmo
LICS
2008
IEEE
14 years 1 months ago
An Algebraic Process Calculus
We present an extension of the πI-calculus with formal sums of terms. The study of the properties of this sum reveals that its neutral element can be used to make assumptions abo...
Emmanuel Beffara
IJON
2007
79views more  IJON 2007»
13 years 7 months ago
Serial interval statistics of spontaneous activity in cortical neurons in vivo and in vitro
Stationary spiking of single neurons is often modelled by a renewal point process. Here, we tested the underlying model assumption that the inter-spike intervals are mutually inde...
Martin P. Nawrot, Clemens Boucsein, Victor Rodrigu...