4009 search results - page 9 / 802 » Clustering on Complex Graphs |
ICPADS
1998
IEEE
13 years 11 months ago
1998
IEEE
The DAG-based task graph model has been found effective in scheduling for performance prediction and optimization of parallel applications. However the scheduling complexity and s...
JMLR
2006
13 years 7 months ago
2006
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
ACMSE
2006
ACM
14 years 1 months ago
2006
ACM
We propose an efficient and novel approach for discovering communities in real-world random networks. Communities are formed by subsets of nodes in a graph, which are closely rela...
ISCAPDCS
2007
13 years 8 months ago
2007
With rapid increase of parallel computation systems in their sizes, it is inevitable to develop algorithms that are applicable even if there exist faulty elements in the systems. ...
WAW
2009
Springer
14 years 2 months ago
2009
Springer
The Modularity-Q measure of community structure is known to falsely ascribe community structure to random graphs, at least when it is naively applied. Although Q is motivated by a ...