Sciweavers

2 search results - page 1 / 1
» A spectral method to separate disconnected and nearly-discon...
Sort
View
47
Voted
KDD
2001
ACM
154views Data Mining» more  KDD 2001»
15 years 10 months ago
A spectral method to separate disconnected and nearly-disconnected web graph components
Chris H. Q. Ding, Xiaofeng He, Hongyuan Zha
CVPR
2006
IEEE
16 years 22 hour ago
Graph Partitioning by Spectral Rounding: Applications in Image Segmentation and Clustering
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