Sciweavers

371 search results - page 15 / 75
» An analysis of a Monte Carlo algorithm for estimating the pe...
Sort
View
CVPR
2010
IEEE
12 years 4 months ago
Abrupt motion tracking via adaptive stochastic approximation Monte Carlo sampling
Robust tracking of abrupt motion is a challenging task in computer vision due to the large motion uncertainty. In this paper, we propose a stochastic approximation Monte Carlo (...
Xiuzhuang Zhou and Yao Lu
JC
1998
65views more  JC 1998»
13 years 7 months ago
Monte Carlo Complexity of Global Solution of Integral Equations
The problem of global solution of Fredholm integral equations is studied. This means that one seeks to approximate the full solution function (as opposed to the local problem, whe...
Stefan Heinrich
NIPS
2008
13 years 9 months ago
Evaluating probabilities under high-dimensional latent variable models
We present a simple new Monte Carlo algorithm for evaluating probabilities of observations in complex latent variable models, such as Deep Belief Networks. While the method is bas...
Iain Murray, Ruslan Salakhutdinov
ILP
2004
Springer
14 years 28 days ago
A Monte Carlo Study of Randomised Restarted Search in ILP
Recent statistical performance surveys of search algorithms in difficult combinatorial problems have demonstrated the benefits of randomising and restarting the search procedure. ...
Filip Zelezný, Ashwin Srinivasan, David Pag...
CORR
2010
Springer
165views Education» more  CORR 2010»
13 years 6 months ago
Monte Carlo Methods for Top-k Personalized PageRank Lists and Name Disambiguation
We study a problem of quick detection of top-k Personalized PageRank lists. This problem has a number of important applications such as finding local cuts in large graphs, estima...
Konstantin Avrachenkov, Nelly Litvak, Danil Nemiro...