It is well-known that inference in graphical models is hard in the worst case, but tractable for models with bounded treewidth. We ask whether treewidth is the only structural cri...
We study iterative randomized greedy algorithms for generating (elimination) orderings with small induced width and state space size - two parameters known to bound the complexity...
Kalev Kask, Andrew Gelfand, Lars Otten, Rina Decht...
We present a probabilistic framework for component-based automatic detection and tracking of objects in video. We represent objects as spatio-temporal two-layer graphical models, w...
Leonid Sigal, Ying Zhu, Dorin Comaniciu, Michael J...
The formalism of probabilistic graphical models provides a unifying framework for capturing complex dependencies among random variables, and building large-scale multivariate stat...
Abstract. The detection and extraction of complex anatomical structures usually involves a trade-off between the complexity of local feature extraction and classification, and th...