213 search results - page 7 / 43 » Semidefinite programming |
VMCAI
2005
Springer
14 years 2 months ago
2005
Springer
IPCO
2008
13 years 10 months ago
2008
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
ICML
2006
IEEE
14 years 9 months ago
2006
IEEE
We derive a robust Euclidean embedding procedure based on semidefinite programming that may be used in place of the popular classical multidimensional scaling (cMDS) algorithm. We...
ICML
2006
IEEE
14 years 9 months ago
2006
IEEE
We present a new unsupervised algorithm for training structured predictors that is discriminative, convex, and avoids the use of EM. The idea is to formulate an unsupervised versi...
ICML
2005
IEEE
14 years 9 months ago
2005
IEEE
Many unsupervised algorithms for nonlinear dimensionality reduction, such as locally linear embedding (LLE) and Laplacian eigenmaps, are derived from the spectral decompositions o...