97 search results - page 2 / 20 » A Randomized Quasi-Monte Carlo Simulation Method for Markov ... |
WSC
2000
13 years 5 months ago
2000
Under certain conditions on the integrand, quasi-Monte Carlo methods for estimating integrals (expectations) converge faster asymptotically than Monte Carlo methods. Motivated by ...
CVPR
2009
IEEE
14 years 2 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...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
For a sensor network, as tractable spatially-dependent node deployment model is presented with the property that the density is inversely proportional to the sink distance. A stoc...
ISPA
2004
Springer
13 years 10 months ago
2004
Springer
The Monte Carlo (MC) method is a simple but effective way to perform simulations involving complicated or multivariate functions. The QuasiMonte Carlo (QMC) method is similar but...
ICPR
2010
IEEE
13 years 11 months ago
2010
IEEE
Many vision applications have been formulated as Markov Random Field (MRF) problems. Although many of them are discrete labeling problems, continuous formulation often achieves gre...