1110 search results - page 45 / 222 » Clustering with the Connectivity Kernel |
ISAAC
2009
Springer
14 years 5 months ago
2009
Springer
We present an algorithm that for any graph G and integer k ≥ 0 in time polynomial in the size of G either nds a spanning tree with at least k internal vertices, or outputs a ne...
ICPR
2008
IEEE
14 years 5 months ago
2008
IEEE
Several validity indices have been designed to evaluate solutions obtained by clustering algorithms. Traditional indices are generally designed to evaluate center-based clustering...
IPPS
2003
IEEE
14 years 3 months ago
2003
IEEE
Clusters of PC containing mostly general purpose hardware have become more and more usable for high performance computing tasks in the past few years. Clustering existing systems ...
INFOCOM
2006
IEEE
14 years 4 months ago
2006
IEEE
— In the standard approach to studying connectivity, a physical layer is assumed that allows direct transmission between neighbors within some fixed distance. The graph resultin...
COMBINATORICS
2006
13 years 10 months ago
2006
Abstract. Let G denote a directed graph with adjacency matrix Q and indegree matrix D. We consider the Kirchhoff matrix L = D - Q, sometimes referred to as the directed Laplacian. ...