Skip to content
conftrace_

semidefinite programming

199 papers

Papers

The Lovász ϑ function, SVMs and finding large dense subgraphs NeurIPS 2012 A Family of Simple Non-Parametric Kernel Learning Algorithms JMLR 2011 Approximating Semidefinite Programs in Sublinear Time NeurIPS 2011 Finite-Time Regional Verification of Stochastic Nonlinear Systems RSS 2011 Information Theoretical Clustering via Semidefinite Programming AISTATS 2011 Maximum Covariance Unfolding : Manifold Learning for Bimodal Data NeurIPS 2011 Maximum Volume Clustering AISTATS 2011 Regularized Laplacian Estimation and Fast Eigenvector Approximation NeurIPS 2011 Large-Scale Matrix Factorization with Missing Data under Additional Constraints NeurIPS 2010 Random Conic Pursuit for Semidefinite Programming NeurIPS 2010 Convex Relaxation of Mixture Regression with Efficient Algorithms NeurIPS 2009 Distance Metric Learning for Large Margin Nearest Neighbor Classification JMLR 2009 Fast Graph Laplacian Regularized Kernel Learning via Semidefinite–Quadratic–Linear Programming NeurIPS 2009 Positive Semidefinite Metric Learning with Boosting NeurIPS 2009 Multi-class Discriminant Kernel Learning via Convex Programming JMLR 2008 Convex Relaxations of Latent Variable Training NeurIPS 2007 Efficient Convex Relaxation for Transductive Support Vector Machine NeurIPS 2007 Ensemble Clustering using Semidefinite Programming NeurIPS 2007 Balanced Graph Matching NeurIPS 2006 Ensemble Pruning Via Semi-definite Programming JMLR 2006 Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problems JMLR 2006 Graph Laplacian Regularization for Large-Scale Semidefinite Programming NeurIPS 2006 Learning the Kernel with Hyperkernels JMLR 2005 Learning the Kernel Matrix with Semidefinite Programming JMLR 2004