Sciweavers

21 search results - page 3 / 5
» An Interruptible Algorithm for Perfect Sampling via Markov C...
Sort
View
BMVC
2000
13 years 6 months ago
Parallel Chains, Delayed Rejection and Reversible Jump MCMC for Object Recognition
We tackle the problem of object recognition using a Bayesian approach. A marked point process [1] is used as a prior model for the (unknown number of) objects. A sample is generat...
M. Harkness, P. Green
ASMTA
2008
Springer
167views Mathematics» more  ASMTA 2008»
13 years 7 months ago
Perfect Simulation of Stochastic Automata Networks
The solution of continuous and discrete-time Markovian models is still challenging mainly when we model large complex systems, for example, to obtain performance indexes of paralle...
Paulo Fernandes, Jean-Marc Vincent, Thais Webber
ALGORITHMICA
2008
82views more  ALGORITHMICA 2008»
13 years 5 months ago
Random Bichromatic Matchings
Given a graph with edges colored Red and Blue, we wish to sample and approximately count the number of perfect matchings with exactly k Red edges. We study a Markov chain on the sp...
Nayantara Bhatnagar, Dana Randall, Vijay V. Vazira...
CVIU
2007
154views more  CVIU 2007»
13 years 5 months ago
Bayesian stereo matching
A Bayesian framework is proposed for stereo vision where solutions to both the model parameters and the disparity map are posed in terms of predictions of latent variables, given ...
Li Cheng, Terry Caelli
KDD
2010
ACM
250views Data Mining» more  KDD 2010»
13 years 9 months ago
Modeling relational events via latent classes
Many social networks can be characterized by a sequence of dyadic interactions between individuals. Techniques for analyzing such events are of increasing interest. In this paper,...
Christopher DuBois, Padhraic Smyth