179 search results - page 12 / 36 » Parallel k h-Means Clustering for Large Data Sets |
CCGRID
2003
IEEE
14 years 4 months ago
2003
IEEE
High-performance peer-to-peer transfer between clusters will be fundamental technology base for various Grid middleware, such as large-scale data transfer in DataGrid settings, or...
LCPC
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. To solve problems that require far more memory than a single machine can supply, data can be swapped to disk in some manner, it can be compressed, and/or the memory of mu...
ICDT
2001
ACM
14 years 3 months ago
2001
ACM
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
VLDB
2002
ACM
13 years 10 months ago
2002
ACM
Given that commercial search engines cover billions of web pages, efficiently managing the corresponding volumes of disk-resident data needed to answer user queries quickly is a f...
AUSAI
2003
Springer
14 years 4 months ago
2003
Springer
Efficient mining of frequent patterns from large databases has been an active area of research since it is the most expensive step in association rules mining. In this paper, we pr...