Many networked applications that run in the background on a mobile device incur significant energy drains when using the cellular radio interface for communication. This is mainl...
Pavan K. Athivarapu, Ranjita Bhagwan, Saikat Guha,...
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of gr...
We apply the dead-end elimination (DEE) strategy from protein design as a heuristic for the max-flow/min-cut formulation of the image segmentation problem. DEE combines aspects of...
In this paper, we propose to use the Colored Pattern Appearance Model (CPAM) as a content representation for video scene break detection. This model represents a scene by means of...