Sciweavers

231 search results - page 32 / 47
» Stochastic Optimization is (Almost) as easy as Deterministic...
Sort
View
UAI
2001
13 years 10 months ago
Iterative Markov Chain Monte Carlo Computation of Reference Priors and Minimax Risk
We present an iterative Markov chain Monte Carlo algorithm for computing reference priors and minimax risk for general parametric families. Our approach uses MCMC techniques based...
John D. Lafferty, Larry A. Wasserman
INFORMATICALT
2010
101views more  INFORMATICALT 2010»
13 years 7 months ago
An Improved Differential Evolution Scheme for the Solution of Large-Scale Unit Commitment Problems
This paper presents an improved differential evolution (IDE) method for the solution of large-scale unit commitment (UC) problems. The objective of the proposed scheme is to determ...
Chen-Sung Chang
PAMI
2010
238views more  PAMI 2010»
13 years 7 months ago
Tracking Motion, Deformation, and Texture Using Conditionally Gaussian Processes
—We present a generative model and inference algorithm for 3D nonrigid object tracking. The model, which we call G-flow, enables the joint inference of 3D position, orientation, ...
Tim K. Marks, John R. Hershey, Javier R. Movellan
PVM
1999
Springer
14 years 29 days ago
Parallel Monte Carlo Algorithms for Sparse SLAE Using MPI
The problem of solving sparse Systems of Linear Algebraic Equations (SLAE) by parallel Monte Carlo numerical methods is considered. The almost optimal Monte Carlo algorithms are pr...
Vassil N. Alexandrov, Aneta Karaivanova
COLT
2008
Springer
13 years 10 months ago
Regret Bounds for Sleeping Experts and Bandits
We study on-line decision problems where the set of actions that are available to the decision algorithm vary over time. With a few notable exceptions, such problems remained larg...
Robert D. Kleinberg, Alexandru Niculescu-Mizil, Yo...