Sciweavers

414 search results - page 49 / 83
» On the Use of Quasi-Monte Carlo Methods in Computational Fin...
Sort
View
IJCV
2008
282views more  IJCV 2008»
15 years 6 days ago
Stereo Matching Using Population-Based MCMC
In this paper, we propose a new stereo matching method using the population-based Markov Chain Monte Carlo (Pop-MCMC), which belongs to the sampling-based methods. Since the previo...
Wonsik Kim (Seoul National University), Joonyoung ...
CF
2005
ACM
13 years 9 months ago
Grid result checking
Result checking is the theory and practice of proving that the result of an execution of a program on an input is correct. Result checking has most often been envisioned in the fr...
Cécile Germain-Renaud, Dephine Monnier-Raga...
EOR
2006
110views more  EOR 2006»
13 years 7 months ago
Scatter search with path relinking for phylogenetic inference
We propose the use of scatter search with path relinking for the inference of phylogenetic trees. Solutions are here represented as trees whose leaves span the set of species unde...
Carlos Cotta
DCC
2010
IEEE
14 years 2 months ago
An MCMC Approach to Lossy Compression of Continuous Sources
Motivated by the Markov chain Monte Carlo (MCMC) relaxation method of Jalali and Weissman, we propose a lossy compression algorithm for continuous amplitude sources that relies on...
Dror Baron, Tsachy Weissman
RT
2005
Springer
14 years 1 months ago
Importance Resampling for Global Illumination
This paper develops importance resampling into a variance reduction technique for Monte Carlo integration. Importance resampling is a sample generation technique that can be used ...
Justin Talbot, David Cline, Parris K. Egbert