299 search results - page 12 / 60 » A Convex Relaxation Approach for Computing Minimal Partition... |
CVPR
2010
IEEE
14 years 1 months ago
2010
IEEE
Sparse representation has found applications in numerous domains and recent developments have been focused on the convex relaxation of the 0-norm minimization for sparse coding (i...
MM
2010
ACM
13 years 8 months ago
2010
ACM
This paper presents an interactive image segmentation framework which is ultra-fast and accurate. Our framework, termed "CO3", consists of three components: COupled repr...
CCE
2004
13 years 7 months ago
2004
Significant advances have been made in the last two decades for the effective solution of mixed integer non-linear programming (MINLP) problems, mainly by exploiting the special s...
COLT
1997
Springer
13 years 12 months ago
1997
Springer
Abstract. We propose a convex optimization approach to solving the nonparametric regression estimation problem when the underlying regression function is Lipschitz continuous. This...
CP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In this paper, we present a constraint-partitioning approach for finding local optimal solutions of large-scale mixed-integer nonlinear programming problems (MINLPs). Ba...