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...
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...
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
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...
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...