Sciweavers

2520 search results - page 2 / 504
» The complexity of approximating entropy
Sort
View
IMA
2009
Springer
113views Cryptology» more  IMA 2009»
14 years 16 days ago
On Linear Cryptanalysis with Many Linear Approximations
Abstract. In this paper we present a theoretical framework to quantify the information brought by several linear approximations of a blockcipher without putting any restriction on ...
Benoît Gérard, Jean-Pierre Tillich
COCO
2004
Springer
82views Algorithms» more  COCO 2004»
13 years 11 months ago
Dimension, Entropy Rates, and Compression
This paper develops new relationships between resource-bounded dimension, entropy rates, and compression. New tools for calculating dimensions are given and used to improve previo...
John M. Hitchcock, N. V. Vinodchandran
ICCS
2007
Springer
14 years 4 days ago
A General Long-Time Molecular Dynamics Scheme in Atomistic Systems: Hyperdynamics in Entropy Dominated Systems
Abstract. We extend the hyperdynamics method developed for lowdimensional energy-dominated systems, to simulate slow dynamics in more general atomistic systems. We show that a few ...
Xin Zhou, Yi Jiang
DCC
2005
IEEE
14 years 5 months ago
Towards Practical Minimum-Entropy Universal Decoding
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
Todd P. Coleman, Muriel Médard, Michelle Ef...
DSN
2011
IEEE
12 years 5 months ago
Approximate analysis of blocking queueing networks with temporal dependence
—In this paper we extend the class of MAP queueing networks to include blocking models, which are useful to describe the performance of service instances which have a limited con...
Vittoria de Nitto Persone, Giuliano Casale, Evgeni...