4009 search results - page 45 / 802 » Clustering on Complex Graphs |
108
click to vote
ICPR
2008
IEEE
16 years 3 months ago
2008
IEEE
In this paper we present a method for impulse noise removal that makes use of spectral clustering and graph regularization. The image is modeled as a graph and local spectral anal...
IJCNN
2008
IEEE
15 years 8 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 ...
GD
2004
Springer
15 years 7 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...
144
click to vote
FAW
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Given a graph G and a nonnegative integer k, the NP-complete Induced Matching problem asks for an edge subset M such that M is a matching and no two edges of M are joined...
112
click to vote
EOR
2008
15 years 2 months ago
2008
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...