4009 search results - page 153 / 802 » Clustering on Complex Graphs |
126
Voted
VISSOFT
2005
IEEE
15 years 9 months ago
2005
IEEE
Dominance analysis from graph theory allows one to locate subordinated software elements in a rooted dependency graph. It identifies the nesting structure for a dependency graph ...
116
click to vote
FSTTCS
2005
Springer
15 years 9 months ago
2005
Springer
We investigate the s-t-connectivity problem for directed planar graphs, which is hard for L and is contained in NL but is not known to be complete. We show that this problem is log...
127
click to vote
ICML
2006
IEEE
16 years 4 months ago
2006
IEEE
We consider the problem of clustering in its most basic form where only a local metric on the data space is given. No parametric statistical model is assumed, and the number of cl...
111
Voted
WCNC
2008
IEEE
15 years 10 months ago
2008
IEEE
—In this paper, a cooperative transmission design for a multi-node wireless cluster network is presented. It is assumed that the nodes operate in half-duplex mode and that channe...
127
click to vote
ICCSA
2004
Springer
15 years 9 months ago
2004
Springer
We propose a hierarchical, cluster based semi-distributed routing protocol for a mobile ad hoc network. The network graph is partitioned into clusters using heuristics and the shor...