15 search results - page 3 / 3 » Approximate Labeling via Graph Cuts Based on Linear Programm... |
CORR
2011
Springer
12 years 8 months ago
2011
Springer
Abstract— We study algorithms for the SUBMODULAR MULTIWAY PARTITION problem (SUB-MP). An instance of SUB-MP consists of a finite ground set V , a subset S = {s1, s2, . . . , sk}...
FSTTCS
2004
Springer
13 years 10 months ago
2004
Springer
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
NIPS
2007
13 years 6 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
CVPR
2007
IEEE
14 years 7 months ago
2007
IEEE
We formulate single-image multi-label segmentation into regions coherent in texture and color as a MAX-SUM problem for which efficient linear programming based solvers have recent...
CN
2006
13 years 5 months ago
2006
Several dynamic QoS routing techniques have been recently proposed for new IP networks based on label forwarding. However, no extensive performance evaluation and comparison is av...