Sciweavers

8810 search results - page 1596 / 1762
» Openness
Sort
View
ASIACRYPT
2006
Springer
15 years 8 months ago
New Guess-and-Determine Attack on the Self-Shrinking Generator
We propose a new type of guess-and-determine attack on the self-shrinking generator (SSG). The inherent flexibility of the new attack enables us to deal with different attack condi...
Bin Zhang, Dengguo Feng
ASPLOS
2006
ACM
15 years 8 months ago
Efficiently exploring architectural design spaces via predictive modeling
Architects use cycle-by-cycle simulation to evaluate design choices and understand tradeoffs and interactions among design parameters. Efficiently exploring exponential-size desig...
Engin Ipek, Sally A. McKee, Rich Caruana, Bronis R...
ATAL
2006
Springer
15 years 8 months ago
Learning to commit in repeated games
Learning to converge to an efficient, i.e., Pareto-optimal Nash equilibrium of the repeated game is an open problem in multiagent learning. Our goal is to facilitate the learning ...
Stéphane Airiau, Sandip Sen
CNSR
2004
IEEE
131views Communications» more  CNSR 2004»
15 years 8 months ago
Fast Flow Classification over Internet
In order to control and manage highly aggregated Internet traffic flows efficiently, we need to be able to categorize flows into distinct classes and to be knowledgeable about the...
A. Oveissian, Kavé Salamatian, Augustin Sou...
COCO
2004
Springer
147views Algorithms» more  COCO 2004»
15 years 8 months ago
The Complexity of the Covering Radius Problem on Lattices and Codes
We initiate the study of the computational complexity of the covering radius problem for point lattices, and approximation versions of the problem for both lattices and linear cod...
Venkatesan Guruswami, Daniele Micciancio, Oded Reg...
« Prev « First page 1596 / 1762 Last » Next »