Sciweavers

179 search results - page 24 / 36
» Parallel k h-Means Clustering for Large Data Sets
Sort
View
ICDM
2006
IEEE
89views Data Mining» more  ICDM 2006»
14 years 4 months ago
On the Lower Bound of Local Optimums in K-Means Algorithm
The k-means algorithm is a popular clustering method used in many different fields of computer science, such as data mining, machine learning and information retrieval. However, ...
Zhenjie Zhang, Bing Tian Dai, Anthony K. H. Tung
EUROPAR
2005
Springer
14 years 4 months ago
Hierarchical Scheduling for Moldable Tasks
The model of moldable task (MT) was introduced some years ago and has been proved to be an efficient way for implementing parallel applications. It considers a target application ...
Pierre-François Dutot
CLUSTER
2002
IEEE
14 years 3 months ago
Noncontiguous I/O through PVFS
With the tremendous advances in processor and memory technology, I/O has risen to become the bottleneck in high-performance computing for many applications. The development of par...
Avery Ching, Alok N. Choudhary, Wei-keng Liao, Rob...
CCGRID
2010
IEEE
13 years 8 months ago
Dynamic Load-Balanced Multicast for Data-Intensive Applications on Clouds
Data-intensive parallel applications on clouds need to deploy large data sets from the cloud's storage facility to all compute nodes as fast as possible. Many multicast algori...
Tatsuhiro Chiba, Mathijs den Burger, Thilo Kielman...
BMCBI
2006
166views more  BMCBI 2006»
13 years 10 months ago
SEQOPTICS: a protein sequence clustering system
Background: Protein sequence clustering has been widely used as a part of the analysis of protein structure and function. In most cases single linkage or graph-based clustering al...
Yonghui Chen, Kevin D. Reilly, Alan P. Sprague, Zh...