4009 search results - page 116 / 802 » Clustering on Complex Graphs |
144
Voted
FPL
2008
Springer
15 years 5 months ago
2008
Springer
This paper presents a new approach for mapping task graphs to heterogeneous hardware/software computing systems using heuristic search techniques. Two techniques: (1) integration ...
130
click to vote
KDD
2004
ACM
15 years 9 months ago
2004
ACM
In this paper, we propose a novel data mining technique for the efficient damage detection within the large-scale complex mechanical structures. Every mechanical structure is defi...
125
Voted
COMGEO
2010
ACM
15 years 3 months ago
2010
ACM
We study the complexity and the I/O-efficient computation of flow on triangulated terrains. We present an acyclic graph, the descent graph, that enables us to trace flow paths in ...
122
Voted
IAT
2006
IEEE
15 years 9 months ago
2006
IEEE
Unstructured P2P networks can grow in an ad-hoc and give rise to scale-free graphs where most of the nodes form clusters or hubs around few resourceful nodes. This leads to conges...
139
Voted
CORR
2012
Springer
13 years 11 months ago
2012
Springer
We show how to compute cartograms with worst-case optimal polygonal complexity. Specifically we study rectilinear duals which are side-contact representations of a planar graph G ...