2142 search results - page 4 / 429 » Hierarchical Adaptive Clustering |
EGPGV
2004
Springer
13 years 10 months ago
2004
Springer
We describe a system for the texture-based direct volume visualization of large data sets on a PC cluster equipped with GPUs. The data is partitioned into volume bricks in object ...
GECCO
2009
Springer
13 years 12 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
CCGRID
2007
IEEE
13 years 11 months ago
2007
IEEE
In the past, efficient parallel algorithms have always been developed specifically for the successive generations of parallel systems (vector machines, shared-memory machines, d...
SC
2004
ACM
13 years 10 months ago
2004
ACM
In petabyte-scale distributed file systems that decouple read and write from metadata operations, behavior of the metadata server cluster will be critical to overall system perfo...
ICPR
2002
IEEE
14 years 6 months ago
2002
IEEE
: One way to scale up clustering algorithms is to squash the data by some intelligent compression technique and cluster only the compressed data records. Such compressed data recor...