Sciweavers

307 search results - page 61 / 62
» The convex hull of ellipsoids
Sort
View
4OR
2010
137views more  4OR 2010»
13 years 6 months ago
Extended formulations in combinatorial optimization
This survey is concerned with the size of perfect formulations for combinatorial optimization problems. By "perfect formulation", we mean a system of linear inequalities...
Michele Conforti, Gérard Cornuéjols,...
CORR
2008
Springer
98views Education» more  CORR 2008»
13 years 6 months ago
Sparse Recovery by Non-convex Optimization -- Instance Optimality
In this note, we address the theoretical properties of p, a class of compressed sensing decoders that rely on p minimization with p (0, 1) to recover estimates of sparse and compr...
Rayan Saab, Özgür Yilmaz
MOR
2008
169views more  MOR 2008»
13 years 6 months ago
The Flow Set with Partial Order
The flow set with partial order is a mixed-integer set described by a budget on total flow and a partial order on the arcs that may carry positive flow. This set is a common substr...
Alper Atamtürk, Muhong Zhang
PR
2008
100views more  PR 2008»
13 years 6 months ago
Boundary based shape orientation
The computation of a shape's orientation is a common task in the area of computer vision and image processing, being used for example to define a local frame of reference and...
Jovisa D. Zunic, Milos Stojmenovic
SIAMCOMP
2000
101views more  SIAMCOMP 2000»
13 years 6 months ago
Motion Planning of Legged Robots
We study the problem of computing the free space F of a simple legged robot called the spider robot. The body of this robot is a single point and the legs are attached to the body....
Jean-Daniel Boissonnat, Olivier Devillers, Sylvain...