2137 search results - page 41 / 428 » Experiments on Graph Clustering Algorithms |
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
By the term "quantization", we refer to the process of using quantum mechanics in order to improve a classical algorithm, usually by making it go faster. In this paper, ...
VL
2005
IEEE
14 years 1 months ago
2005
IEEE
Abstract— Visualizing software architecture faces the challenges of both data complexity and visual complexity. This paper presents an approach for visualizing software architect...
ICPR
2008
IEEE
14 years 2 months ago
2008
IEEE
In the past, clusterings combination approaches are based on “flat” clustering algorithms, i.e. algorithms that operate on non-hierarchical clustering schemes. These approache...
CATS
2006
13 years 9 months ago
2006
We consider the following clustering problems: given a general undirected graph, partition its vertices into disjoint clusters such that each cluster forms a clique and the number...
CCGRID
2008
IEEE
13 years 9 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...