484 search results - page 56 / 97 » PGAC: A Parallel Genetic Algorithm for Data Clustering |
WWW
2011
ACM
13 years 4 months ago
2011
ACM
The clustering coefficient of a node in a social network is a fundamental measure that quantifies how tightly-knit the community is around the node. Its computation can be reduce...
DAC
2001
ACM
14 years 10 months ago
2001
ACM
Clustering is an effective method to increase the available parallelism in VLIW datapaths without incurring severe penalties associated with large number of register file ports. E...
ISSAC
2007
Springer
14 years 3 months ago
2007
Springer
Through the use of a new disk-based method for enumerating very large orbits, condensation for orbits with tens of billions of elements can be performed. The algorithm is novel in...
CCGRID
2007
IEEE
14 years 3 months ago
2007
IEEE
Data Grids provide transparent access to heterogeneous and autonomous data resources. The main contribution of this paper is the presentation of a data sharing system that (i) is ...
ADMA
2009
Springer
14 years 3 months ago
2009
Springer
The goal of multi-objective clustering (MOC) is to decompose a dataset into similar groups maximizing multiple objectives in parallel. In this paper, we provide a methodology, arch...