Sciweavers

91 search results - page 13 / 19
» A Sequential Monte Carlo Method for Motif Discovery
Sort
View
ECCV
2008
Springer
14 years 7 months ago
Window Annealing over Square Lattice Markov Random Field
Monte Carlo methods and their subsequent simulated annealing are able to minimize general energy functions. However, the slow convergence of simulated annealing compared with more ...
Ho Yub Jung, Kyoung Mu Lee, Sang Uk Lee
IPPS
2010
IEEE
13 years 7 months ago
On the parallelisation of MCMC by speculative chain execution
Abstract--The increasing availability of multi-core and multiprocessor architectures provides new opportunities for improving the performance of many computer simulations. Markov C...
Jonathan M. R. Byrd, Stephen A. Jarvis, Abhir H. B...
ETT
2002
93views Education» more  ETT 2002»
13 years 9 months ago
Quantum simulation - rare event simulation by means of cloning, thinning and distortion
A method of rare event simulation, termed here quantum simulation, and known also (with some variations) as population Monte Carlo, and Sequential Markov Chain simulation, is appli...
R. G. Addie
SAC
2008
ACM
13 years 8 months ago
Computational methods for complex stochastic systems: a review of some alternatives to MCMC
We consider analysis of complex stochastic models based upon partial information. MCMC and reversible jump MCMC are often the methods of choice for such problems, but in some situ...
Paul Fearnhead
WSC
2008
13 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