Sciweavers

478 search results - page 12 / 96
» Convexity minimizes pseudo-triangulations
Sort
View
TASLP
2010
142views more  TASLP 2010»
13 years 2 months ago
Beyond the Narrowband Approximation: Wideband Convex Methods for Under-Determined Reverberant Audio Source Separation
We consider the problem of extracting the source signals from an under-determined convolutive mixture assuming known mixing filters. State-of-the-art methods operate in the time-fr...
M. Kowalski, Emmanuel Vincent, Rémi Gribonv...
JOTA
2010
117views more  JOTA 2010»
13 years 6 months ago
Distributed Stochastic Subgradient Projection Algorithms for Convex Optimization
We consider a distributed multi-agent network system where the goal is to minimize a sum of agent objective functions subject to a common set of constraints. For this problem, we p...
S. Sundhar Ram, Angelia Nedic, Venugopal V. Veerav...
NIPS
2008
13 years 9 months ago
On the Efficient Minimization of Classification Calibrated Surrogates
Bartlett et al (2006) recently proved that a ground condition for convex surrogates, classification calibration, ties up the minimization of the surrogates and classification risk...
Richard Nock, Frank Nielsen
FOCM
2011
175views more  FOCM 2011»
13 years 2 months ago
Convergence of Fixed-Point Continuation Algorithms for Matrix Rank Minimization
The matrix rank minimization problem has applications in many fields such as system identification, optimal control, low-dimensional embedding etc. As this problem is NP-hard in ...
Donald Goldfarb, Shiqian Ma
CVPR
2009
IEEE
15 years 3 months ago
A Convex Relaxation Approach for Computing Minimal Partitions
In this work we propose a convex relaxation approach for computing minimal partitions. Our approach is based on rewriting the minimal partition problem (also known as Potts mode...
Thomas Pock (Graz University of Technology), Anton...