264 search results - page 40 / 53 » On Linear Cryptanalysis with Many Linear Approximations |
107
click to vote
FOCS
2007
IEEE
15 years 6 months ago
2007
IEEE
d Abstract) Kousha Etessami LFCS, School of Informatics University of Edinburgh Mihalis Yannakakis Department of Computer Science Columbia University We reexamine what it means to...
APPROX
2005
Springer
15 years 5 months ago
2005
Springer
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
BIRD
2008
Springer
15 years 1 months ago
2008
Springer
Finding motifs in biological sequences is one of the most intriguing problems for string algorithms designers due to, on the one hand, the numerous applications of this problem in...
142
click to vote
SIAMCOMP
2010
14 years 10 months ago
2010
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...
118
click to vote
CVPR
2009
IEEE
16 years 6 months ago
2009
IEEE
Image blur and noise are difficult to avoid in many situations
and can often ruin a photograph. We present a novel
image deconvolution algorithm that deblurs and denoises
an ima...