Sciweavers

560 search results - page 96 / 112
» Level-set methods for convex optimization
Sort
View
CORR
2007
Springer
130views Education» more  CORR 2007»
15 years 1 months ago
Lagrangian Relaxation for MAP Estimation in Graphical Models
Abstract— We develop a general framework for MAP estimation in discrete and Gaussian graphical models using Lagrangian relaxation techniques. The key idea is to reformulate an in...
Jason K. Johnson, Dmitry M. Malioutov, Alan S. Wil...
KDD
2007
ACM
197views Data Mining» more  KDD 2007»
16 years 2 months ago
Learning the kernel matrix in discriminant analysis via quadratically constrained quadratic programming
The kernel function plays a central role in kernel methods. In this paper, we consider the automated learning of the kernel matrix over a convex combination of pre-specified kerne...
Jieping Ye, Shuiwang Ji, Jianhui Chen
TROB
2002
138views more  TROB 2002»
15 years 1 months ago
Interference-free polyhedral configurations for stacking
This paper uses a configuration space ( -space) based method to compute interference-free configuration for stacking polyhedral sheet metal parts. This work forms the interference ...
Venkateswara R. Ayyadevara, David A. Bourne, Kenji...
SIAMJO
2010
246views more  SIAMJO 2010»
15 years 9 days ago
A Singular Value Thresholding Algorithm for Matrix Completion
This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood a...
Jian-Feng Cai, Emmanuel J. Candès, Zuowei S...
104
Voted
CVPR
2007
IEEE
16 years 4 months ago
A Linear Programming Approach for Multiple Object Tracking
We propose a linear programming relaxation scheme for the class of multiple object tracking problems where the inter-object interaction metric is convex and the intraobject term q...
Hao Jiang, Sidney Fels, James J. Little