Sciweavers

32 search results - page 4 / 7
» Convex relaxations for quadratic distance problems
Sort
View
CVPR
2010
IEEE
13 years 7 months ago
GPCA with denoising: A moments-based convex approach
This paper addresses the problem of segmenting a combination of linear subspaces and quadratic surfaces from sample data points corrupted by (not necessarily small) noise. Our mai...
Necmiye Ozay, Mario Sznaier, Constantino M. Lagoa,...
STOC
2005
ACM
156views Algorithms» more  STOC 2005»
14 years 7 months ago
Convex programming for scheduling unrelated parallel machines
We consider the classical problem of scheduling parallel unrelated machines. Each job is to be processed by exactly one machine. Processing job j on machine i requires time pij . ...
Yossi Azar, Amir Epstein

Publication
433views
14 years 3 months ago
Optimal Feature Selection for Subspace Image Matching
Image matching has been a central research topic in computer vision over the last decades. Typical approaches for correspondence involve matching features between images. In this p...
Gemma Roig, Xavier Boix, Fernando De la Torre
JMIV
2006
124views more  JMIV 2006»
13 years 7 months ago
Iterative Total Variation Regularization with Non-Quadratic Fidelity
Abstract. A generalized iterative regularization procedure based on the total variation penalization is introduced for image denoising models with non-quadratic convex fidelity ter...
Lin He, Martin Burger, Stanley Osher
MP
2010
128views more  MP 2010»
13 years 5 months ago
Perspective reformulations of mixed integer nonlinear programs with indicator variables
Abstract. We study mixed integer nonlinear programs (MINLP)s that are driven by a collection of indicator variables where each indicator variable controls a subset of the decision ...
Oktay Günlük, Jeff Linderoth