We introduce the Minimum-size bounded-capacity cut (MinSBCC) problem, in which we are given a graph with an identified source and seek to find a cut minimizing the number of node...
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
Current state-of-the-art image-based scene reconstruction
techniques are capable of generating high-fidelity 3D
models when used under controlled capture conditions.
However, th...
Jean-Yves Guillemaut, Joe Kilner and Adrian Hilton
We optimize over the set of corrected laplacians (CL) associated with a weighted graph to improve the average case normalized cut (NCut) of a graph. Unlike edge-relaxation SDPs, o...
In this paper, we propose a graph-based method for fullyautomatic segmentation of the left ventricle and atrium in 3D ultrasound (3DUS) volumes. Our method requires no user input ...
Radford Juang, Elliot R. McVeigh, Beatrice Hoffman...