Fast SDP relaxations of graph cut clustering, transduction, and other combinatorial problems

TEP De Bie, N Cristianini

Research output: Contribution to journalArticle (Academic Journal)peer-review

41 Citations (Scopus)

Fingerprint

Dive into the research topics of 'Fast SDP relaxations of graph cut clustering, transduction, and other combinatorial problems'. Together they form a unique fingerprint.

Computer Science