1118 search results - page 61 / 224 » Convex Optimization |
116
click to vote
ESA
2008
Springer
15 years 6 months ago
2008
Springer
Let O = {O1, . . . , Om} be a set of m convex polygons in R2 with a total of n vertices, and let B be another convex k-gon. A placement of B, any congruent copy of B (without refle...
122
Voted
SIAMJO
2010
14 years 11 months ago
2010
In this paper we propose a new exchange method for solving convex semi-infinite programming (CSIP) problems. We introduce a new dropping-rule in the proposed exchange algorithm, wh...
121
click to vote
CCCG
2010
15 years 6 months ago
2010
We examine the problem of pushing all the points of a planar region into one point using parallel sweeps of an infinite line, minimizing the sum of the lengths of the sweep vector...
162
click to vote
CVPR
2010
IEEE
16 years 1 months ago
2010
IEEE
This paper studies the problem of simultaneously aligning a batch of linearly correlated images despite gross corruption (such as occlusion). Our method seeks an optimal set of im...
134
click to vote
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...