157 search results - page 4 / 32 » Symmetrizations for clustering directed graphs |
IESS
2007
Springer
13 years 11 months ago
2007
Springer
Abstract This paper presents an embedded system design toolchain for automatic generation of parallel code runnable on symmetric multiprocessor systems from an initial sequential s...
PVLDB
2010
13 years 3 months ago
2010
The identification of clusters, well-connected components in a graph, is useful in many applications from biological function prediction to social community detection. However, ...
IV
2005
IEEE
13 years 11 months ago
2005
IEEE
The conventional force-directed methods for drawing undirected graphs are based on either vertex-vertex repulsion or vertex-edge repulsion. In this paper, we propose a new force-d...
EMMCVPR
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. Grouping is a global partitioning process that integrates local cues distributed over the entire image. We identify four types of pairwise relationships, attraction and r...
IM
2008
13 years 5 months ago
2008
In this paper we consider three models for random graphs that utilize the inner product as their fundamental object. We analyze the behavior of these models with respect to cluster...