522 search results - page 11 / 105 » Energy Models for Graph Clustering |
87
Voted
IPPS
2010
IEEE
14 years 7 months ago
2010
IEEE
Abstract--For the management of a virtual P2P supercomputer one is interested in subgroups of processors that can communicate with each other efficiently. The task of finding these...
AAIM
2009
Springer
15 years 4 months ago
2009
Springer
We introduce the s-Plex Editing problem generalizing the well-studied Cluster Editing problem, both being NP-hard and both being motivated by graph-based data clustering. Instead o...
96
Voted
ICIP
2007
IEEE
15 years 11 months ago
2007
IEEE
In this paper, we present a novel active contour model, in which the traditional gradient descent optimization is replaced by graph cut optimization. The basic idea is to first de...
GD
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. One of the most popular graph drawing methods is based on achieving graph-theoretic target distances. This method was used by Kamada and Kawai [15], who formulated it as ...
RSA
2011
14 years 4 months ago
2011
In 2007 we introduced a general model of sparse random graphs with independence between the edges. The aim of this paper is to present an extension of this model in which the edge...