15494 search results - page 409 / 3099 » Computing dynamic clusters |
149
click to vote
ISPA
2005
Springer
16 years 10 days ago
2005
Springer
Abstract. There exist numerous algorithms that cluster data-points from largescale genomic experiments such as sequencing, gene-expression and proteomics. Such algorithms may emplo...
183
click to vote
SSPR
2004
Springer
16 years 5 days ago
2004
Springer
We present a novel clustering method using HMM parameter space and eigenvector decomposition. Unlike the existing methods, our algorithm can cluster both constant and variable leng...
165
click to vote
ECRTS
2003
IEEE
16 years 4 days ago
2003
IEEE
When time-triggered (TT) systems are to be deployed for large embedded real-time (RT) control systems in cars and airplanes, one way to overcome bandwidth limitations and achieve ...
192
Voted
ICDM
2002
IEEE
15 years 11 months ago
2002
IEEE
The k-means algorithm with cosine similarity, also known as the spherical k-means algorithm, is a popular method for clustering document collections. However, spherical k-means ca...
190
click to vote
CSE
2009
IEEE
15 years 11 months ago
2009
IEEE
—In this paper we propose a clustering and routing scheme for wireless sensor networks based on a self-organizing approach. The aim of this approach is for nodes to perform an in...