521 search results - page 9 / 105 » Coring method for clustering a graph |
120
click to vote
APVIS
2007
15 years 5 months ago
2007
In this paper, we consider the problem of navigating graphs drawn in 2.5 dimensions. First, we define criteria for good navigation and then present various methods to satisfy som...
113
click to vote
IJCNN
2008
IEEE
15 years 10 months ago
2008
IEEE
— We present an analytic and geometric view of the sample mean of graphs. The theoretical framework yields efficient subgradient methods for approximating a structural mean and ...
100
click to vote
GD
2004
Springer
15 years 9 months ago
2004
Springer
Compound-fisheye views are introduced as a method for the display and interaction with large graphs. The method relies on a hierarchical clustering of the graph, and a generalizat...
160
click to vote
DEXA
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. The problems of finding alternative clusterings and avoiding bias have gained popularity over the last years. In this paper we put the focus on the quality of these alter...
129
click to vote
ISSAC
2007
Springer
15 years 10 months ago
2007
Springer
It is only in the last five years that researchers have begun to use disk-based search techniques on a large scale. The primary examples of its use come from symbolic algebra and...