Sciweavers

268 search results - page 28 / 54
» Recursion Theoretic Operators for Function Complexity Classe...
Sort
View
COR
2008
122views more  COR 2008»
14 years 9 months ago
First steps to the runtime complexity analysis of ant colony optimization
: The paper presents results on the runtime complexity of two ant colony optimization (ACO) algorithms: Ant System, the oldest ACO variant, and GBAS, the first ACO variant for whic...
Walter J. Gutjahr
FOCS
1999
IEEE
15 years 1 months ago
Near-Optimal Conversion of Hardness into Pseudo-Randomness
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson
ASIACRYPT
2008
Springer
14 years 11 months ago
An Improved Impossible Differential Attack on MISTY1
MISTY1 is a Feistel block cipher that received a great deal of cryptographic attention. Its recursive structure, as well as the added FL layers, have been successful in thwarting v...
Orr Dunkelman, Nathan Keller
CORR
2010
Springer
102views Education» more  CORR 2010»
14 years 9 months ago
On Factor Universality in Symbolic Spaces
The study of factoring relations between subshifts or cellular automata is central in symbolic dynamics. Besides, a notion of intrinsic universality for cellular automata based on ...
Laurent Boyer, Guillaume Theyssier
ICC
2007
IEEE
110views Communications» more  ICC 2007»
15 years 4 months ago
Joint Source and Channel Coding for Image Transmission over Time Varying Channels
—In this paper, the joint source and channel coding for progressive image transmission over channels with varying SNR is considered. Since the feedback of channel status informat...
Lei Cao