Sciweavers

75 search results - page 5 / 15
» Approximate inference by Markov chains on union spaces
Sort
View
STOC
1989
ACM
99views Algorithms» more  STOC 1989»
13 years 11 months ago
A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies
We present a randomised polynomial time algorithm for approximating the volume of a convex body K in n-dimensional Euclidean space. The proof of correctness of the algorithm relie...
Martin E. Dyer, Alan M. Frieze, Ravi Kannan
ICML
2002
IEEE
14 years 8 months ago
Univariate Polynomial Inference by Monte Carlo Message Length Approximation
We apply the Message from Monte Carlo (MMC) algorithm to inference of univariate polynomials. MMC is an algorithm for point estimation from a Bayesian posterior sample. It partiti...
Leigh J. Fitzgibbon, David L. Dowe, Lloyd Allison
TR
2008
164views more  TR 2008»
13 years 7 months ago
Inference Based on Type-II Hybrid Censored Data From a Weibull Distribution
A hybrid censoring scheme is a mixture of Type-I and Type-II censoring schemes. This article presents the statistical inferences on Weibull parameters when the data are Type-II hyb...
Aveek Banerjee, Debasis Kundu
ICCV
1999
IEEE
13 years 12 months ago
Bayesian Structure from Motion
:We formulate structure from motion as a Bayesian inference problem, and use a Markov chain Monte Carlo sampler to sample the posterior on this problem. This results in a method th...
David A. Forsyth, Sergey Ioffe, John A. Haddon
CVIU
2007
154views more  CVIU 2007»
13 years 7 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