478 search results - page 12 / 96 » Convexity minimizes pseudo-triangulations |
103
click to vote
TASLP
2010
14 years 8 months ago
2010
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...
98
Voted
JOTA
2010
15 years 10 days ago
2010
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...
123
Voted
NIPS
2008
15 years 3 months ago
2008
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...
113
Voted
FOCM
2011
14 years 9 months ago
2011
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 ...
154
Voted
CVPR
2009
IEEE
16 years 9 months ago
2009
IEEE
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...