840 search results - page 140 / 168 » Inapproximability of Combinatorial Optimization Problems |
TWC
2010
13 years 5 months ago
2010
We consider a system with a single base station communicating with multiple users over orthogonal channels while being assisted by multiple relays. Several recent works have sugge...
CVPR
2010
IEEE
14 years 7 months ago
2010
IEEE
Purely bottom-up, unsupervised segmentation of a single
image into two segments remains a challenging task for
computer vision. The co-segmentation problem is the process
of joi...
EMMCVPR
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Meaningful notions of distance between planar shapes typically involve the computation of a correspondence between points on one shape and points on the other. To determi...
APPROX
2008
Springer
14 years 29 days ago
2008
Springer
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
FOCS
2008
IEEE
14 years 1 days ago
2008
IEEE
In this paper we consider the following maximum budgeted allocation (MBA) problem: Given a set of m indivisible items and n agents; each agent i willing to pay bij on item j and w...