115 search results - page 16 / 23 » Scalable Discovery of Best Clusters on Large Graphs |
LCN
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract—We study the performance of several search algorithms on unstructured peer-to-peer networks, both using classic search algorithms such as flooding and random walk, as w...
IPPS
2008
IEEE
14 years 1 months ago
2008
IEEE
We present SNAP (Small-world Network Analysis and Partitioning), an open-source graph framework for exploratory study and partitioning of large-scale networks. To illustrate the c...
CIKM
2008
Springer
13 years 9 months ago
2008
Springer
In the past, quite a few fast algorithms have been developed to mine frequent patterns over graph data, with the large spectrum covering many variants of the problem. However, the...
IPPS
2009
IEEE
14 years 2 months ago
2009
IEEE
The increasing demand for computational cycles is being met by the use of multi-core processors. Having large number of cores per node necessitates multi-core aware designs to ext...
BIBM
2010
IEEE
13 years 5 months ago
2010
IEEE
The 1000 Genome project has made available a large number of single nucleotide polymorphisms (SNPs) for genome-wide association studies (GWAS). However, the large number of SNPs ha...