Sciweavers

530 search results - page 9 / 106
» Bounds on marginal probability distributions
Sort
View
NIPS
2003
13 years 9 months ago
Linear Response for Approximate Inference
Belief propagation on cyclic graphs is an efficient algorithm for computing approximate marginal probability distributions over single nodes and neighboring nodes in the graph. I...
Max Welling, Yee Whye Teh
QUESTA
2007
117views more  QUESTA 2007»
13 years 7 months ago
Estimating tail probabilities of heavy tailed distributions with asymptotically zero relative error
Efficient estimation of tail probabilities involving heavy tailed random variables is amongst the most challenging problems in Monte-Carlo simulation. In the last few years, appli...
Sandeep Juneja
ICPR
2006
IEEE
14 years 9 months ago
Real-Time 3D Articulated Pose Tracking using Particle Filters Interacting through Belief Propagation
This article proposes a new statistical model for fast 3D articulated body tracking, similar to the loose-limbed model, but where inter-frame coherence is taken into account by us...
Olivier Bernier
RC
2007
64views more  RC 2007»
13 years 7 months ago
Unimodality, Independence Lead to NP-Hardness of Interval Probability Problems
In many real-life situations, we only have partial information about probabilities. This information is usually described by bounds on moments, on probabilities of certain events,...
Daniel Berleant, Olga Kosheleva, Vladik Kreinovich...
ICML
2006
IEEE
14 years 8 months ago
Totally corrective boosting algorithms that maximize the margin
We consider boosting algorithms that maintain a distribution over a set of examples. At each iteration a weak hypothesis is received and the distribution is updated. We motivate t...
Gunnar Rätsch, Jun Liao, Manfred K. Warmuth