Sciweavers

895 search results - page 6 / 179
» Approximate convex decomposition
Sort
View
CORR
2008
Springer
92views Education» more  CORR 2008»
14 years 9 months ago
Convex Sparse Matrix Factorizations
We present a convex formulation of dictionary learning for sparse signal decomposition. Convexity is obtained by replacing the usual explicit upper bound on the dictionary size by...
Francis Bach, Julien Mairal, Jean Ponce
COCOON
2006
Springer
15 years 1 months ago
A PTAS for Cutting Out Polygons with Lines
We present a simple O(m+n6 / 12 ) time (1+ )-approximation algorithm for the problem of cutting a convex n-gon out of a convex m-gon with line cuts of minimum total cutting length....
Sergey Bereg, Ovidiu Daescu, Minghui Jiang
VLSM
2005
Springer
15 years 3 months ago
A Study of Non-smooth Convex Flow Decomposition
We present a mathematical and computational feasibility study of the variational convex decomposition of 2D vector fields into coherent structures and additively superposed flow ...
Jing Yuan, Christoph Schnörr, Gabriele Steidl...
MOC
2002
144views more  MOC 2002»
14 years 9 months ago
Convergence rate analysis of an asynchronous space decomposition method for convex Minimization
Abstract. We analyze the convergence rate of an asynchronous space decomposition method for constrained convex minimization in a reflexive Banach space. This method includes as spe...
Xue-Cheng Tai, Paul Tseng
COMGEO
2008
ACM
14 years 9 months ago
Decomposing a simple polygon into pseudo-triangles and convex polygons
In this paper we consider the problem of decomposing a simple polygon into subpolygons that exclusively use vertices of the given polygon. We allow two types of subpolygons: pseud...
Stefan Gerdjikov, Alexander Wolff