Sciweavers

218 search results - page 9 / 44
» cluster 1998
Sort
View
KDD
1998
ACM
123views Data Mining» more  KDD 1998»
14 years 3 months ago
Scaling Clustering Algorithms to Large Databases
Practical clustering algorithms require multiple data scans to achieve convergence. For large databases, these scans become prohibitively expensive. We present a scalable clusteri...
Paul S. Bradley, Usama M. Fayyad, Cory Reina
IPPS
1998
IEEE
14 years 2 months ago
Comparing the Optimal Performance of Different MIMD Multiprocessor Architectures
We compare the performance of systems consisting of one large cluster containing q processors with systems where processors are grouped into k clusters containing u processors eac...
Lars Lundberg, Håkan Lennerstad
ACISICIS
2007
IEEE
14 years 5 months ago
Minimum Message Length Clustering of Spatially-Correlated Data with Varying Inter-Class Penalties
We present here some applications of the Minimum Message Length (MML) principle to spatially correlated data. Discrete valued Markov Random Fields are used to model spatial correl...
Gerhard Visser, David L. Dowe
HPCA
1998
IEEE
14 years 3 months ago
Challenging Applications on Fast Networks
Parallel computing on clusters of workstations is attractive because of the low costs in comparison to MPPs, but the speed of the local area network limits the class of applicatio...
Koen Langendoen, Rutger F. H. Hofman, Henri E. Bal
DT
1998
85views more  DT 1998»
13 years 10 months ago
How Much Logic Should Go in an FPGA Logic Block?
The logic blocks of most modern FPGAs contain clusters of look-up tables and flip flops, yet little is known about good choices for several key architectural parameters related ...
Vaughn Betz, Jonathan Rose