Sciweavers

24 search results - page 5 / 5
» Speeding up Parallel Graph Coloring
Sort
View
WWW
2011
ACM
12 years 11 months ago
Counting triangles and the curse of the last reducer
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...
Siddharth Suri, Sergei Vassilvitskii
JIB
2008
76views more  JIB 2008»
13 years 4 months ago
WebStruct and VisualStruct: web interfaces and visualization for Structure software implemented in a cluster environment
Structure, is a widely used software tool to investigate population genetic structure with multi-locus genotyping data. The software uses an iterative algorithm to group individua...
B. Jayashree, S. Rajgopal, David A. Hoisington, V....
ENTCS
2002
89views more  ENTCS 2002»
13 years 4 months ago
ZEUS: A Distributed Timed Model-Checker Based on KRONOS
In this work we present Zeus, a Distributed Model-Checker that evolves from the tool Kronos [8] and that currently can handle backwards computation of TCTLreachability properties ...
Víctor A. Braberman, Alfredo Olivero, Ferna...
PODC
2009
ACM
14 years 5 months ago
Fast distributed random walks
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
Atish Das Sarma, Danupon Nanongkai, Gopal Panduran...