Sciweavers

2137 search results - page 168 / 428
» Experiments on Graph Clustering Algorithms
Sort
View
105
Voted
JPDC
2008
129views more  JPDC 2008»
15 years 2 months ago
A framework for scalable greedy coloring on distributed-memory parallel computers
We present a scalable framework for parallelizing greedy graph coloring algorithms on distributed-memory computers. The framework unifies several existing algorithms and blends a ...
Doruk Bozdag, Assefaw Hadish Gebremedhin, Fredrik ...
SDM
2007
SIAM
107views Data Mining» more  SDM 2007»
15 years 3 months ago
On Demand Phenotype Ranking through Subspace Clustering
High throughput biotechnologies have enabled scientists to collect a large number of genetic and phenotypic attributes for a large collection of samples. Computational methods are...
Xiang Zhang, Wei Wang 0010, Jun Huan
119
Voted
NPC
2004
Springer
15 years 7 months ago
Request Distribution for Fairness with a New Load-Update Mechanism in Web Server Cluster
The complexity of services and applications provided by Web sites is ever increasing as integration of traditional Web publishing sites with new paradigms, i.e., e-commerce. Each d...
MinHwan Ok, Myong-Soon Park
HPDC
2000
IEEE
15 years 6 months ago
Distributed Processor Allocation in Large PC Clusters
Current processor allocation techniques for highly parallel systems are based on centralized front-end based algorithms. As a result, the applied strategies are restricted to stat...
Hans-Ulrich Heiss, César A. F. De Rose, Phi...
103
Voted
KDD
2004
ACM
114views Data Mining» more  KDD 2004»
16 years 2 months ago
Scalable mining of large disk-based graph databases
Mining frequent structural patterns from graph databases is an interesting problem with broad applications. Most of the previous studies focus on pruning unfruitful search subspac...
Chen Wang, Wei Wang 0009, Jian Pei, Yongtai Zhu, B...