Browsing University of Waterloo by Subject "nuclear norm minimization"
Now showing items 1-1 of 1
-
Convex relaxation for the planted clique, biclique, and clustering problems
(University of Waterloo, 2011-08-24)A clique of a graph G is a set of pairwise adjacent nodes of G. Similarly, a biclique (U, V ) of a bipartite graph G is a pair of disjoint, independent vertex sets such that each node in U is adjacent to every node in V ...