7 search results - page 2 / 2 » Max cut and the smallest eigenvalue |
CORR
2011
Springer
13 years 7 days ago
2011
Springer
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...
PAMI
2007
13 years 4 months ago
2007
This paper exploits the properties of the commute time between nodes of a graph for the purposes of clustering and embedding, and explores its applications to image segmentation a...