Sciweavers

417 search results - page 51 / 84
» Convex Shape Decomposition
Sort
View
CORR
2010
Springer
143views Education» more  CORR 2010»
13 years 5 months ago
CUR from a Sparse Optimization Viewpoint
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...
Jacob Bien, Ya Xu, Michael W. Mahoney
CORR
2010
Springer
159views Education» more  CORR 2010»
13 years 5 months ago
Counting Plane Graphs: Flippability and its Applications
We generalize the notions of flippable and simultaneously-flippable edges in a triangulation of a set S of points in the plane, into so called pseudo simultaneously-flippable edge...
Michael Hoffmann, Micha Sharir, Adam Sheffer, Csab...
ICCV
2009
IEEE
15 years 18 days ago
Efficient Discriminative Learning of Parts-based Models
Supervised learning of a parts-based model can be for- mulated as an optimization problem with a large (exponen- tial in the number of parts) set of constraints. We show how thi...
M. Pawan Kumar, Andrew Zisserman, Philip H.S. Torr
CVPR
2010
IEEE
14 years 3 months ago
Learning Shift-Invariant Sparse Representation of Actions
A central problem in the analysis of motion capture (Mo- Cap) data is how to decompose motion sequences into primitives. Ideally, a description in terms of primitives should fac...
Yi Li
SIAMJO
2008
86views more  SIAMJO 2008»
13 years 7 months ago
On the Second-Order Feasibility Cone: Primal-Dual Representation and Efficient Projection
We study the second-order feasibility cone F = {y IRn : My gT y} for given data (M, g). We construct a new representation for this cone and its dual based on the spectral decompo...
Alexandre Belloni, Robert M. Freund