Sciweavers

179 search results - page 17 / 36
» Parallel k h-Means Clustering for Large Data Sets
Sort
View
CF
2010
ACM
14 years 2 months ago
Hybrid parallel programming with MPI and unified parallel C
The Message Passing Interface (MPI) is one of the most widely used programming models for parallel computing. However, the amount of memory available to an MPI process is limited ...
James Dinan, Pavan Balaji, Ewing L. Lusk, P. Saday...
DATAMINE
2002
125views more  DATAMINE 2002»
13 years 10 months ago
High-Performance Commercial Data Mining: A Multistrategy Machine Learning Application
We present an application of inductive concept learning and interactive visualization techniques to a large-scale commercial data mining project. This paper focuses on design and c...
William H. Hsu, Michael Welge, Thomas Redman, Davi...
ICTAI
2003
IEEE
14 years 4 months ago
Parallel Mining of Maximal Frequent Itemsets from Databases
In this paper, we propose a parallel algorithm for mining maximal frequent itemsets from databases. A frequent itemset is maximal if none of its supersets is frequent. The new par...
Soon Myoung Chung, Congnan Luo
ICPADS
1998
IEEE
14 years 3 months ago
A Comparison of Two Torus-Based K-Coteries
We extend a torus-based coterie structure for distributed mutual exclusion to allow k multiple entries in a critical section. In the original coterie, the system nodes are logical...
S. D. Lang, L. J. Mao
CLUSTER
2005
IEEE
14 years 4 months ago
Efficient and Robust Computation of Resource Clusters in the Internet
Applications such as parallel computing, online games, and content distribution networks need to run on a set of resources with particular network connection characteristics to ge...
Chuang Liu, Ian T. Foster