895 search results - page 5 / 179 » Approximate convex decomposition |
171
click to vote
ORL
2011
14 years 6 months ago
2011
We derive a convex relaxation for cardinality constrained Principal Component Analysis (PCA) by using a simple representation of the L1 unit ball and standard Lagrangian duality. ...
ICPR
2008
IEEE
16 years 27 days ago
2008
IEEE
We propose a linear in time and easy-to-implement algorithm that robustly decomposes a digital curve into convex and concave parts. This algorithm is based on classical tools in d...
115
click to vote
FOCM
2010
14 years 10 months ago
2010
We show how to approximate the feasible region of structured convex optimization problems by a family of convex sets with explicitly given and efficient (if the accuracy of the ap...
MP
2006
14 years 11 months ago
2006
CORR
2010
Springer
14 years 9 months ago
2010
Springer
The CUR decomposition provides an approximation of a matrix X that has low reconstruction error and that is sparse in the sense that the resulting approximation lies in the span o...