We consider a probabilistic model for the Steiner Tree problem. Under this model the problem is defined in a 2-stage setting over a first-stage complete weighted graph having it...
In many AI domains such as product configuration, a user should interactively specify a solution that must satisfy a set of constraints. In such scenarios, offline compilation of ...
Henrik Reif Andersen, Tarik Hadzic, David Pisinger
Graph partitioning algorithms play a central role in data analysis and machine learning. Most useful graph partitioning criteria correspond to optimizing a ratio between the cut a...
This paper examines the problem of extracting lowdimensional manifold structure given millions of highdimensional face images. Specifically, we address the computational challenge...
Recent methods based on interest points and local fingerprints have been proposed to perform robust CBCD (content-based copy detection) of images and video. They include two steps...