1118 search results - page 18 / 224 » Convex Optimization |
126
click to vote
SODA
1996
ACM
15 years 5 months ago
1996
ACM
Given a convex polygon P with m vertices and a set S of n points in the plane, we consider the problem of nding a placement of P that contains the maximum number of points in S. W...
141
click to vote
EOR
2010
15 years 4 months ago
2010
We consider the unrelated parallel machines scheduling problem where jobs have earliness and tardiness penalties and a common due date. We formulate this problem and some of its v...
133
Voted
CVPR
2010
IEEE
15 years 6 months ago
2010
IEEE
This paper addresses the problem of jointly clustering two segmentations of closely correlated images. We focus in particular on the application of reconstructing neuronal structu...
129
click to vote
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
— We consider the uplink power control problem where mobile users in different cells are communicating with their base stations. We formulate the power control problem as the min...
157
click to vote
JMLR
2012
13 years 6 months ago
2012
Sparse additive models are families of d-variate functions with the additive decomposition f∗ = ∑j∈S f∗ j , where S is an unknown subset of cardinality s d. In this paper,...