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
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
21
search results - page 5 / 5
»
Distributed Iterative Detection in an Interference Limited C...
Sort
relevance
views
votes
recent
update
View
thumb
title
148
Voted
KDD
2008
ACM
165
views
Data Mining
»
more
KDD 2008
»
Colibri: fast mining of large static and dynamic graphs
16 years 3 months ago
Download
www.cs.cmu.edu
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
Hanghang Tong, Spiros Papadimitriou, Jimeng Sun, P...
claim paper
Read More »
« Prev
« First
page 5 / 5
Last »
Next »