Search Results for author:
Found 5 papers, 1 papers with code
Incremental Inference on Higher-Order Probabilistic Graphical Models Applied to Constraint Satisfaction Problems
The first is a comparison between factor graphs and cluster graphs on graph colouring problems such as Sudokus - indicating a significant advantage for preferring cluster graphs.
A Probabilistic Graphical Model Approach to the Structure-and-Motion Problem
We present a means of formulating and solving the well known structure-and-motion problem in computer vision with probabilistic graphical models.
Graph Coloring: Comparing Cluster Graphs to Factor Graphs
We present a means of formulating and solving graph coloring problems with probabilistic graphical models.
Strengthening Probabilistic Graphical Models: The Purge-and-merge Algorithm
It is in principle possible to convert loopy PGMs to an equivalent tree structure, but this is usually impractical for interesting problems due to exponential blow-up.
Plant-wide fault and disturbance screening using combined transfer entropy and eigenvector centrality analysis
Finding the source of a disturbance or fault in complex systems such as industrial chemical processing plants can be a difficult task and consume a significant number of engineering hours.
