Sciweavers

2 search results - page 1 / 1

» A spectral method to separate disconnected and nearly-discon...

103

KDD
2001
ACM

154views Data Mining» more KDD 2001»

A spectral method to separate disconnected and nearly-disconnected web graph components

16 years 6 months ago

A spectral method to separate disconnected and nearly-disconnected web graph components

Download www.cc.gatech.edu

Chris H. Q. Ding, Xiaofeng He, Hongyuan Zha

claim paper

Read More »

146

CVPR
2006
IEEE

234views Computer Vision» more CVPR 2006»

Graph Partitioning by Spectral Rounding: Applications in Image Segmentation and Clustering

16 years 8 months ago

Graph Partitioning by Spectral Rounding: Applications in Image Segmentation and Clustering

Download www.cs.cmu.edu

ct We introduce a new family of spectral partitioning methods. Edge separators of a graph are produced by iteratively reweighting the edges until the graph disconnects into the pre...

David Tolliver, Gary L. Miller

claim paper

Read More »

« Prev « First page 1 / 1 Last » Next »