Sciweavers

814 search results - page 47 / 163
» Graphical Models for Graph Matching
Sort
View
WSC
2007
14 years 17 days ago
Composability and component-based discrete event simulation
This work presents a framework and a Graphical User Interface, Viskit, for the creation and analysis of component-based Discrete Event Simulation models. Two primary elements of t...
Arnold H. Buss, Curtis L. Blais
CVPR
2011
IEEE
13 years 6 months ago
Learning Message-Passing Inference Machines for Structured Prediction
Nearly every structured prediction problem in computer vision requires approximate inference due to large and complex dependencies among output labels. While graphical models prov...
Stephane Ross, Daniel Munoz, J. Andrew Bagnell
NIPS
2003
13 years 11 months ago
Approximability of Probability Distributions
We consider the question of how well a given distribution can be approximated with probabilistic graphical models. We introduce a new parameter, effective treewidth, that captures...
Alina Beygelzimer, Irina Rish
CVPR
2007
IEEE
15 years 8 days ago
Learning and Matching Line Aspects for Articulated Objects
Traditional aspect graphs are topology-based and are impractical for articulated objects. In this work we learn a small number of aspects, or prototypical views, from video data. ...
Xiaofeng Ren
ISAAC
2007
Springer
158views Algorithms» more  ISAAC 2007»
14 years 4 months ago
On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...
Uffe Flarup, Pascal Koiran, Laurent Lyaudet