Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
We study the expected number of interior vertices of degree i in a triangulation of a point set S, drawn uniformly at random from the set of all triangulations of S, and derive va...
The definitions of four previously studied parameters related to total coverings and total matchings of graphs can be restricted, thereby obtaining eight parameters related to cov...
For a chordal graph G = (V, E), we study the problem of whether a new vertex u V and a given set of edges between u and vertices in V can be added to G so that the resulting grap...
We formulate multi-view 3D shape reconstruction as the computation of a minimum cut on the dual graph of a semiregular, multi-resolution, tetrahedral mesh. Our method does not ass...
Sudipta N. Sinha, Philippos Mordohai, Marc Pollefe...