115 search results - page 20 / 23 » Scalable Discovery of Best Clusters on Large Graphs |
ISCA
2012
IEEE
11 years 10 months ago
2012
IEEE
—As the scales of parallel applications and platforms increase the negative impact of communication latencies on performance becomes large. Fortunately, modern High Performance C...
NIPS
2004
13 years 8 months ago
2004
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
WWW
2010
ACM
14 years 2 months ago
2010
ACM
Detecting clusters or communities in large real-world graphs such as large social or information networks is a problem of considerable interest. In practice, one typically chooses...
SEMWEB
2009
Springer
14 years 2 months ago
2009
Springer
In this paper, we consider the problem of materializing the complete finite RDFS closure in a scalable manner; this includes those parts of the RDFS closure that are often ignored...
VLDB
2005
ACM
14 years 29 days ago
2005
ACM
Multi-join queries are the core of any integration service that integrates data from multiple distributed data sources. Due to the large number of data sources and possibly high v...