57 search results - page 3 / 12 » On a linear programming approach to the discrete Willmore bo... |
COCOS
2003
Springer
13 years 10 months ago
2003
Springer
We investigate some approaches to solving nonconvex global optimization problems by convex nonlinear programming methods. We assume that the problem becomes convex when selected va...
NIPS
2003
13 years 6 months ago
2003
Learning from ambiguous training data is highly relevant in many applications. We present a new learning algorithm for classification problems where labels are associated with se...
CVPR
2006
IEEE
13 years 11 months ago
2006
IEEE
This paper introduces a new representation for planar curves. From the well-known Dirichlet problem for a disk, the harmonic function embedded in a circular disk is solely depende...
STOC
2004
ACM
14 years 5 months ago
2004
ACM
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
SIAMMAX
2010
13 years 18 hour ago
2010
We propose a new approach to estimate the joint spectral radius and the joint spectral subradius of an arbitrary set of matrices. We first restrict our attention to matrices that ...