15494 search results - page 383 / 3099 » Computing dynamic clusters |
173
click to vote
DCOSS
2005
Springer
16 years 10 days ago
2005
Springer
Abstract: Since nodes in a sensor network have limited energy, prolonging the network lifetime and improving scalability become important. In this paper, we propose a distributed w...
186
click to vote
GD
2005
Springer
16 years 10 days ago
2005
Springer
Widely varying node degrees occur in software dependency graphs, hyperlink structures, social networks, and many other real-world graphs. Finding dense subgraphs in such graphs is ...
198
click to vote
GFKL
2005
Springer
16 years 10 days ago
2005
Springer
Abstract. The problem of clustering data can be formulated as a graph partitioning problem. In this setting, spectral methods for obtaining optimal solutions have received a lot of...
161
click to vote
ICCS
2005
Springer
16 years 9 days ago
2005
Springer
Existing methods for time series clustering rely on the actual data values can become impractical since the methods do not easily handle dataset with high dimensionality, missing v...
188
click to vote
ICIC
2005
Springer
16 years 9 days ago
2005
Springer
This paper proposes two methods which take advantage of k -mean clustering algorithm to decrease the number of support vectors (SVs) for the training of support vector machine (SVM...