179 search results - page 6 / 36 » Parallel k h-Means Clustering for Large Data Sets |
SEMWEB
2009
Springer
15 years 4 months ago
2009
Springer
In this paper, we consider the problem of materializing the complete finite RDFS closure in a scalable manner; this includes those parts of the RDFS closure that are often ignored...
FLAIRS
2004
14 years 11 months ago
2004
Clustering is used to organize data for efficient retrieval. One of the problems in clustering is the identification of clusters in given data. A popular technique for clustering ...
DMIN
2006
14 years 11 months ago
2006
Clustering is the process of locating patterns in large data sets. It is an active research area that provides value to scientific as well as business applications. Practical clust...
116
Voted
EGPGV
2004
Springer
15 years 3 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 ...
IPPS
2009
IEEE
15 years 4 months ago
2009
IEEE
A metascalable (or “design once, scale on new architectures”) parallel computing framework has been developed for large spatiotemporal-scale atomistic simulations of materials...