895 search results - page 109 / 179 » Approximate convex decomposition |
JMLR
2010
14 years 4 months ago
2010
We use convex relaxation techniques to provide a sequence of regularized low-rank solutions for large-scale matrix completion problems. Using the nuclear norm as a regularizer, we...
113
click to vote
JMLR
2012
13 years 7 days ago
2012
We study a generalized framework for structured sparsity. It extends the well known methods of Lasso and Group Lasso by incorporating additional constraints on the variables as pa...
ICML
2009
IEEE
15 years 10 months ago
2009
IEEE
In this paper, we explore an application of basis pursuit to audio scene analysis. The goal of our work is to detect when certain sounds are present in a mixed audio signal. We fo...
MOBIHOC
2006
ACM
15 years 9 months ago
2006
ACM
We consider the problem of designing distributed mechanisms for joint congestion control and resource allocation in spatial-reuse TDMA wireless networks. The design problem is pos...
COMPGEOM
2003
ACM
15 years 3 months ago
2003
ACM
We introduce (1/r)-cuttings for collections of surfaces in 3-space that are sensitive to an additional collection of curves. Specifically, let S be a set of n surfaces in R3 of c...