3875 search results - page 280 / 775 » Approximation algorithms for the 0-extension problem |
455
click to vote
COCOON
2011
Springer
14 years 6 months ago
2011
Springer
Motivated by a security problem in geographic information systems, we study the following graph theoretical problem: given a graph G, two special nodes s and t in G, and a number k...
209
click to vote
TSP
2012
14 years 2 months ago
2012
Abstract—We consider a robust downlink beamforming optimization problem for secondary multicast transmission in a multiple-input multiple-output (MIMO) spectrum sharing cognitive...
193
click to vote
DAGM
2009
Springer
15 years 7 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...
191
click to vote
COCO
2007
Springer
16 years 28 days 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...
195
click to vote
ICCV
1999
IEEE
16 years 8 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...