15494 search results - page 421 / 3099 » Computing dynamic clusters |
143
click to vote
PAMI
1998
15 years 6 months ago
1998
—Algorithmic enhancements are described that enable large computational reduction in mean square-error data clustering. These improvements are incorporated into a parallel data-c...
197
click to vote
BMCBI
2010
15 years 7 months ago
2010
Background: In recent years, the demand for computational power in computational biology has increased due to rapidly growing data sets from microarray and other high-throughput t...
186
click to vote
ISPDC
2008
IEEE
16 years 1 months ago
2008
IEEE
We consider the problem of computing all Nash equilibria in bimatrix games (i.e., nonzero-sum two-player noncooperative games). Computing all Nash equilibria for large bimatrix ga...
179
click to vote
CCGRID
2008
IEEE
16 years 1 months ago
2008
IEEE
In this paper we present a multicost algorithm for the joint time scheduling of the communication and computation resources that will be used by a task. The proposed algorithm sel...
202
click to vote
IPPS
2003
IEEE
16 years 4 days ago
2003
IEEE
We describe a peer-to-peer self-organizing overlay network for our global computing system. The preliminary simulation results show that the network has some smallworld characteri...