Sciweavers

1450 search results - page 70 / 290
» Complexity of Inference in Graphical Models
Sort
View
TSP
2010
13 years 3 months ago
Gaussian multiresolution models: exploiting sparse Markov and covariance structure
We consider the problem of learning Gaussian multiresolution (MR) models in which data are only available at the finest scale and the coarser, hidden variables serve both to captu...
Myung Jin Choi, Venkat Chandrasekaran, Alan S. Wil...
AMDO
2006
Springer
14 years 22 days ago
Monocular Tracking with a Mixture of View-Dependent Learned Models
This paper considers the problem of monocular human body tracking using learned models. We propose to learn the joint probability distribution of appearance and body pose using a m...
Tobias Jaeggli, Esther Koller-Meier, Luc J. Van Go...
CVPR
2009
IEEE
15 years 4 months ago
Discriminatively Trained Particle Filters for Complex Multi-Object Tracking
This work presents a discriminative training method for particle filters in the context of multi-object tracking. We are motivated by the difficulty of hand-tuning the many mode...
Alan Fern, Robin Hess
CORR
2007
Springer
82views Education» more  CORR 2007»
13 years 9 months ago
Programs as polygraphs: computability and complexity
Abstract – This study presents Albert Burroni’s polygraphs as an algebraic and graphical description of first-order functional programs, where functions can have many outputs....
Guillaume Bonfante, Yves Guiraud
INFORMS
1998
150views more  INFORMS 1998»
13 years 8 months ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
Alexander Bockmayr, Thomas Kasper