Sciweavers

1229 search results - page 145 / 246
» On the gaussian distribution of strings
Sort
View
GECCO
2008
Springer
124views Optimization» more  GECCO 2008»
15 years 7 months ago
Aiming for a theoretically tractable CSA variant by means of empirical investigations
Evolution Strategies (ES) for black-box optimization of a function f : Rn → R are investigated. Namely, we consider the cumulative step-size adaptation (CSA) for the variance of...
Jens Jägersküpper, Mike Preuss
CORR
2007
Springer
112views Education» more  CORR 2007»
15 years 6 months ago
Learning from compressed observations
— The problem of statistical learning is to construct a predictor of a random variable Y as a function of a related random variable X on the basis of an i.i.d. training sample fr...
Maxim Raginsky
ECCC
2007
185views more  ECCC 2007»
15 years 6 months ago
Trapdoors for Hard Lattices and New Cryptographic Constructions
We show how to construct a variety of “trapdoor” cryptographic tools assuming the worst-case hardness of standard lattice problems (such as approximating the length of the sho...
Craig Gentry, Chris Peikert, Vinod Vaikuntanathan
PAMI
2006
138views more  PAMI 2006»
15 years 6 months ago
Context-Based Segmentation of Image Sequences
We describe an algorithm for context-based segmentation of visual data. New frames in an image sequence (video) are segmented based on the prior segmentation of earlier frames in ...
Jacob Goldberger, Hayit Greenspan
DCC
2011
IEEE
15 years 1 months ago
Accurate estimates of the data complexity and success probability for various cryptanalyses
Abstract Many attacks on encryption schemes rely on statistical considerations using plaintext/ciphertext pairs to find some information on the key. We provide here simple formula...
Céline Blondeau, Benoît Gérard...