927 search results - page 55 / 186 » Stability of k -Means Clustering |
JSCIC
2006
13 years 8 months ago
2006
This paper deals with the identification of a zone permitting fluid to leak out of a drain. Using the analogy with crack identification by boundary measurements, we give uniqueness...
DAGSTUHL
2007
13 years 9 months ago
2007
We consider the problems of set partitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost function is given by an oracle, and we ...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
—Clustering techniques create hierarchal network structures, called clusters, on an otherwise flat network. In a dynamic environment—in terms of node mobility as well as in ter...
CPM
2000
Springer
14 years 13 days ago
2000
Springer
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
IWQOS
2004
Springer
14 years 1 months ago
2004
Springer
— Clustering sensor nodes increases the scalability and energy efficiency of communications among them. In hostile environments, unexpected failures or attacks on cluster heads ...