3874 search results - page 249 / 775 » Approximation Algorithms for k-hurdle Problems |
113
click to vote
AAIM
2007
Springer
15 years 10 months ago
2007
Springer
The Generalized Maximum Dispersion problem asks for a partition of a given graph into p vertex-disjoint sets, each of them having at most k vertices. The goal is to maximize the to...
149
click to vote
DAGM
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. Graph cuts have become very popular in many areas of computer vision including segmentation, energy minimization, and 3D reconstruction. Their ability to find optimal res...
148
click to vote
COCO
2007
Springer
15 years 10 months ago
2007
Springer
A t-design for quantum states is a finite set of quantum states with the property of simulating the Haar-measure on quantum states w.r.t. any test that uses at most t copies of a...
153
Voted
ICCV
1999
IEEE
16 years 6 months ago
1999
IEEE
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function's smoothnes...
131
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Existing value function approximation methods have been successfully used in many applications, but they often lack useful a priori error bounds. We propose a new approximate bili...