Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
2
search results - page 1 / 1
»
A spectral method to separate disconnected and nearly-discon...
Sort
relevance
views
votes
recent
update
View
thumb
title
14
click to vote
KDD
2001
ACM
154
views
Data Mining
»
more
KDD 2001
»
A spectral method to separate disconnected and nearly-disconnected web graph components
14 years 7 months ago
Download
www.cc.gatech.edu
Chris H. Q. Ding, Xiaofeng He, Hongyuan Zha
claim paper
Read More »
29
click to vote
CVPR
2006
IEEE
234
views
Computer Vision
»
more
CVPR 2006
»
Graph Partitioning by Spectral Rounding: Applications in Image Segmentation and Clustering
14 years 9 months ago
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 »