Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
1706.06028
Cited By
Clustering is semidefinitely not that hard: Nonnegative SDP for manifold disentangling
19 June 2017
Mariano Tepper
Anirvan M. Sengupta
D. Chklovskii
Re-assign community
ArXiv
PDF
HTML
Papers citing
"Clustering is semidefinitely not that hard: Nonnegative SDP for manifold disentangling"
2 / 2 papers shown
Title
Relax, no need to round: integrality of clustering formulations
Pranjal Awasthi
Afonso S. Bandeira
Moses Charikar
Ravishankar Krishnaswamy
Soledad Villar
Rachel A. Ward
77
114
0
18 Aug 2014
Algorithms for nonnegative matrix factorization with the beta-divergence
Cédric Févotte
Jérôme Idier
84
802
0
08 Oct 2010
1