927 search results - page 15 / 186 » Stability of k -Means Clustering |
141
click to vote
PRDC
2007
IEEE
16 years 10 days ago
2007
IEEE
Failure detector class Ωk has been defined in [18] as an extension to failure detector Ω, and an algorithm has been given in [16] to solve k-set agreement using Ωk in async...
PRL
2010
15 years 24 days ago
2010
160
click to vote
ESCAPE
2007
Springer
15 years 10 months ago
2007
Springer
In the NP-hard Cluster Editing problem, we have as input an undirected graph G and an integer k 0. The question is whether we can transform G, by inserting and deleting at most k ...
152
click to vote
AHSWN
2008
15 years 6 months ago
2008
In this paper, we present a new efficient strategy for constructing a wireless tree network containing n nodes of diameter while satisfying the QoS requirements such as bandwidth...