494 search results - page 6 / 99 » Optimal Carpet Cutting |
PAMI
2010
13 years 5 months ago
2010
—In partitioning, clustering, and grouping problems, a typical goal is to group together similar objects, or pixels in the case of image processing. At the same time, another goa...
PR
2007
13 years 6 months ago
2007
We introduce a new graph cut for clustering which we call the Information Cut. It is derived using Parzen windowing to estimate an information theoretic distance measure between p...
ATMOS
2010
13 years 6 months ago
2010
The Team Orienteering Problem is a routing problem on a graph with durations associated to the arcs and profits assigned to visiting the vertices. A fixed number of identical ve...
PAMI
2007
13 years 6 months ago
2007
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
IOR
2011
13 years 2 months ago
2011
In this paper, we give a finite disjunctive programming procedure to obtain the convex hull of general mixed-integer linear programs (MILP) with bounded integer variables. We prop...