6142 search results - page 491 / 1229 » The Complexity of Partition Functions |
224
click to vote
DMKD
1997
ACM
15 years 11 months ago
1997
ACM
Partitioning a large set of objects into homogeneous clusters is a fundamental operation in data mining. The k-means algorithm is best suited for implementing this operation becau...
188
click to vote
EMMCVPR
1997
Springer
15 years 11 months ago
1997
Springer
Abstract. In this paper a rigorous mathematical framework of deterministic annealing and mean-field approximation is presented for a general class of partitioning, clustering and ...
190
click to vote
DAC
1996
ACM
15 years 11 months ago
1996
ACM
Abstract A divide-and-conquer algorithm for computing the parametric yield of large analog circuits is presented. The algorithm targets applications whose performance spreads could...
175
click to vote
ISHPC
1997
Springer
15 years 11 months ago
1997
Springer
Abstract. Writing e cient iterative solvers for irregular, sparse matrices in HPF is hard. The locality in the computations is unclear, and for e ciency we use storage schemes that...
184
click to vote
FDL
2004
IEEE
15 years 10 months ago
2004
IEEE
Reconfigurability is becoming an important part of System-on-Chip (SoC) design to cope with the increasing demands for simultaneous flexibility and computational power. Current ha...