1578 search results - page 92 / 316 » Algorithmic randomness of continuous functions |
GECCO
2007
Springer
15 years 4 months ago
2007
Springer
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
SIAMCO
2000
14 years 9 months ago
2000
We study almost-sure limiting properties, taken as 0, of the finite horizon sequence of random estimates { 0, 1, 2, . . . , T/ } for the linear stochastic gradient algorithm n+1 ...
CHES
1999
Springer
15 years 2 months ago
1999
Springer
The strength of a cryptographic function depends on the amount of entropy in the cryptovariables that are used as keys. Using a large key length with a strong algorithm is false co...
112
click to vote
JMLR
2012
13 years 8 days ago
2012
We address the problem of finding the most likely assignment or MAP estimation in a Markov random field. We analyze the linear programming formulation of MAP through the lens of...
122
click to vote
CVPR
2009
IEEE
15 years 8 months ago
2009
IEEE
Many vision problems have been formulated as en- ergy minimization problems and there have been signif- icant advances in energy minimization algorithms. The most widely-used energ...