2131 search results - page 121 / 427 » Co-Scheduling of Computation and Data on Computer Clusters |
139
click to vote
NIPS
2001
15 years 5 months ago
2001
The popular K-means clustering partitions a data set by minimizing a sum-of-squares cost function. A coordinate descend method is then used to nd local minima. In this paper we sh...
132
click to vote
NIPS
2001
15 years 5 months ago
2001
In previous work on "transformed mixtures of Gaussians" and "transformed hidden Markov models", we showed how the EM algorithm in a discrete latent variable mo...
129
click to vote
NIPS
2004
15 years 5 months ago
2004
Dominant sets are a new graph-theoretic concept that has proven to be relevant in pairwise data clustering problems, such as image segmentation. They generalize the notion of a ma...
153
click to vote
PARA
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. In this article we present the results obtained from the execution of a commercial Computational Fluid Dynamics program on a cluster of personal computers. The communicat...
106
click to vote
CSREAESA
2006
15 years 5 months ago
2006
- Ever-increasing demands of space missions for data returns from their limited processing and communications resources have made the traditional approach of data gathering, data c...