136 search results - page 10 / 28 » Graph Nodes Clustering Based on the Commute-Time Kernel |
EUROPAR
2004
Springer
15 years 3 months ago
2004
Springer
We propose an architecture that consists of a ring of clusters for distributed mutual exclusion algorithms in mobile networks. The mobile network is partitioned into a number of cl...
105
click to vote
TKDE
2012
13 years 1 hour ago
2012
— This paper presents a method for identifying a set of dense subgraphs of a given sparse graph. Within the main applications of this “dense subgraph problem”, the dense subg...
106
click to vote
CCGRID
2008
IEEE
14 years 11 months ago
2008
IEEE
In this article, we revisit the problem of scheduling dynamically generated directed acyclic graphs (DAGs) of multi-processor tasks (M-tasks). A DAG is a basic model for expressin...
WABI
2009
Springer
15 years 4 months ago
2009
Springer
Comparative analysis of biomolecular networks constructed using measurements from different conditions, tissues, and organisms offer a powerful approach to understanding the stru...
AAAI
2008
14 years 12 months ago
2008
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...