Sciweavers

115 search results - page 15 / 23
» Scalable Discovery of Best Clusters on Large Graphs
Sort
View
IPPS
1998
IEEE
13 years 11 months ago
Hyper Butterfly Network: A Scalable Optimally Fault Tolerant Architecture
Boundeddegreenetworks like deBruijn graphsor wrapped butterfly networks are very important from VLSI implementation point of view as well as for applications where the computing n...
Wei Shi, Pradip K. Srimani
SIGMOD
2008
ACM
144views Database» more  SIGMOD 2008»
14 years 7 months ago
Mining significant graph patterns by leap search
With ever-increasing amounts of graph data from disparate sources, there has been a strong need for exploiting significant graph patterns with user-specified objective functions. ...
Xifeng Yan, Hong Cheng, Jiawei Han, Philip S. Yu
ICDCS
2007
IEEE
14 years 1 months ago
Magellan: Charting Large-Scale Peer-to-Peer Live Streaming Topologies
Live peer-to-peer (P2P) streaming applications have been successfully deployed in the Internet. With relatively simple peer selection protocol design, modern live P2P streaming ap...
Chuan Wu, Baochun Li, Shuqiao Zhao
KDD
2008
ACM
138views Data Mining» more  KDD 2008»
14 years 8 months ago
A visual-analytic toolkit for dynamic interaction graphs
In this article we describe a visual-analytic tool for the interrogation of evolving interaction network data such as those found in social, bibliometric, WWW and biological appli...
Xintian Yang, Sitaram Asur, Srinivasan Parthasarat...
ICALP
2000
Springer
13 years 11 months ago
Scalable Secure Storage when Half the System Is Faulty
In this paper, we provide a method to safely store a document in perhaps the most challenging settings, a highly decentralized replicated storage system where up to half of the st...
Noga Alon, Haim Kaplan, Michael Krivelevich, Dahli...