Revision as of 03:21, 11 April 2011 edit Mspreitz (talk \| contribs) 16 edits No edit summary ← Previous edit		Revision as of 13:43, 4 May 2016 edit undo Cle003 (talk \| contribs) 14 edits →Bipartitioning a graph with the eigenvector Next edit →
Line 18: How does one "use the eigenvector with the smallest eigenvalue to bipartition the graph"? Is there another article to which we could link that would provide those details? --[[Special:Contributions/76.27.96.159\|76.27.96.159]] ([[User talk:76.27.96.159\|talk]]) 04:29, 10 December 2008 (UTC) Shi and Malik, 2000 advice to use the second smallest eigenvector to bipartition the graph == Example ==

Talk:Segmentation-based object categorization: Difference between revisions