Sciweavers

1541 search results - page 128 / 309
» Analysis of Random Noise and Random Walk Algorithms
Sort
View
NIPS
2003
15 years 6 months ago
On the Concentration of Expectation and Approximate Inference in Layered Networks
We present an analysis of concentration-of-expectation phenomena in layered Bayesian networks that use generalized linear models as the local conditional probabilities. This frame...
XuanLong Nguyen, Michael I. Jordan
112
Voted
ECCC
2006
97views more  ECCC 2006»
15 years 4 months ago
Runtime Analysis of a Simple Ant Colony Optimization Algorithm
Ant Colony Optimization (ACO) has become quite popular in recent years. In contrast to many successful applications, the theoretical foundation of this randomized search heuristic...
Frank Neumann, Carsten Witt
69
Voted
CORR
2008
Springer
74views Education» more  CORR 2008»
15 years 5 months ago
Analysis of the Karmarkar-Karp Differencing Algorithm
The Karmarkar-Karp differencing algorithm is the best known polynomial time heuristic for the number partitioning problem, fundamental in both theoretical computer science and stat...
Stefan Boettcher, Stephan Mertens
138
Voted
GECCO
2005
Springer
140views Optimization» more  GECCO 2005»
15 years 10 months ago
Intransitivity revisited coevolutionary dynamics of numbers games
Relative fitness, or “evaluation by tests” is one of the building blocks of coevolution: the only fitness information available is a comparison with other individuals in a p...
Pablo Funes, Enrique Pujals
ICCV
2001
IEEE
16 years 6 months ago
Euclidean Reconstruction and Auto-Calibration from Continuous Motion
This paper deals with the problem of incorporating natural regularity conditions on the motion in an MAP estimator for structure and motion recovery from uncalibrated image sequen...
Fredrik Kahl, Anders Heyden