120 search results - page 9 / 24 » Approximation and Hardness Results for Label Cut and Related... |
ACCV
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. This paper addresses the problem of super resolution - obtaining a single high-resolution image given a set of low resolution images which are related by small displaceme...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
SIAMCOMP
2000
13 years 7 months ago
2000
We present a linear programming-based method for nding \gadgets", i.e., combinatorial structures reducing constraints of one optimization problem to constraints of another. A...
COCO
2004
Springer
13 years 11 months ago
2004
Springer
We initiate the study of the computational complexity of the covering radius problem for point lattices, and approximation versions of the problem for both lattices and linear cod...
CCCG
2010
13 years 9 months ago
2010
We obtain hardness results and approximation algorithms for two related geometric problems involving movement. The first is a constrained variant of the k-center problem, arising ...