560 search results - page 44 / 112 » Level-set methods for convex optimization |
126
Voted
WADS
1995
Springer
15 years 7 months ago
1995
Springer
We consider the problem of obtaining “nice” quadrangulations of planar sets of points. For many applications “nice” means that the quadrilaterals obtained are convex if po...
112
click to vote
INTERSPEECH
2010
14 years 10 months ago
2010
Musical noise often arises in the outputs of time-frequency binary mask based blind source separation approaches. Postprocessing is desired to enhance the separation quality. An e...
121
click to vote
ICML
2009
IEEE
15 years 10 months ago
2009
IEEE
In this work, we extend the ellipsoid method, which was originally designed for convex optimization, for online learning. The key idea is to approximate by an ellipsoid the classi...
163
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Gaussian graphical models are of great interest in statistical learning. Because the conditional independencies between different nodes correspond to zero entries in the inverse c...
130
click to vote
CVPR
2006
IEEE
16 years 5 months ago
2006
IEEE
In this paper we propose a practical and efficient method for finding the globally optimal solution to the problem of pose estimation of a known object. We present a framework tha...