30 search results - page 4 / 6 » Analyzing the Scalability of Graph Algorithms on Eldorado |
SIGMOD
2010
ACM
13 years 7 months ago
2010
ACM
Discriminative subgraphs are widely used to define the feature space for graph classification in large graph databases. Several scalable approaches have been proposed to mine disc...
ICDM
2010
IEEE
13 years 5 months ago
2010
IEEE
In recent years, many networks have become available for analysis, including social networks, sensor networks, biological networks, etc. Graph clustering has shown its effectivenes...
CLUSTER
2006
IEEE
14 years 1 months ago
2006
IEEE
This paper presents a middleware framework for storing, accessing and analyzing massive-scale semantic graphs. The framework, MSSG, targets scale-free semantic graphs with O(1012 ...
JMLR
2010
13 years 6 months ago
2010
How can we generate realistic networks? In addition, how can we do so with a mathematically tractable model that allows for rigorous analysis of network properties? Real networks ...
PLDI
2012
ACM
11 years 10 months ago
2012
ACM
Modularity is a central theme in any scalable program analysis. The core idea in a modular analysis is to build summaries at procedure boundaries, and use the summary of a procedu...