Sciweavers

97 search results - page 5 / 20
» A Randomized Quasi-Monte Carlo Simulation Method for Markov ...
Sort
View
TOMACS
2011
139views more  TOMACS 2011»
14 years 4 months ago
The double CFTP method
We consider the problem of the exact simulation of random variables Z that satisfy the distributional identity Z L = V Y + (1 − V )Z, where V ∈ [0, 1] and Y are independent, an...
Luc Devroye, Lancelot F. James
96
Voted
WSC
2008
14 years 11 months ago
Randomized methods for solving the Winner Determination Problem in combinatorial auctions
Combinatorial auctions, where buyers can bid on bundles of items rather than bidding them sequentially, often lead to more economically efficient allocations of financial resource...
Joshua C. C. Chan, Dirk P. Kroese
JMLR
2010
145views more  JMLR 2010»
14 years 4 months ago
Parallelizable Sampling of Markov Random Fields
Markov Random Fields (MRFs) are an important class of probabilistic models which are used for density estimation, classification, denoising, and for constructing Deep Belief Netwo...
James Martens, Ilya Sutskever
ICASSP
2011
IEEE
14 years 1 months ago
Enhanced Poisson sum representation for alpha-stable processes
In this paper we present Poisson sum series representations for α-stable (αS) random variables and α-stable processes, in particular concentrating on continuous-time autoregres...
Tatjana Lemke, Simon J. Godsill
CSDA
2010
118views more  CSDA 2010»
14 years 9 months ago
Grapham: Graphical models with adaptive random walk Metropolis algorithms
Recently developed adaptive Markov chain Monte Carlo (MCMC) methods have been applied successfully to many problems in Bayesian statistics. Grapham is a new open source implementat...
Matti Vihola