15494 search results - page 339 / 3099 » Computing dynamic clusters |
151
click to vote
ASPDAC
2005
ACM
15 years 8 months ago
2005
ACM
— In this paper we present a scheme for reducing the amount of synchronization overhead needed between components, after HW/SW partitioning, to preserve the original control flo...
162
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
The aim of the paper is to introduce general techniques in order to optimize the parallel execution time of sorting on a distributed architectures with processors of various speeds...
141
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
Conventional clustering methods typically assume that each data item belongs to a single cluster. This assumption does not hold in general. In order to overcome this limitation, w...
151
click to vote
KDD
2001
ACM
16 years 7 months ago
2001
ACM
Clustering algorithms have become increasingly important in handling and analyzing data. Considerable work has been done in devising effective but increasingly specific clustering...
176
click to vote
ICDM
2009
IEEE
16 years 1 months ago
2009
IEEE
— Redistricting is the process of dividing a geographic area into districts or zones. This process has been considered in the past as a problem that is computationally too comple...