Sciweavers

332 search results - page 52 / 67
» Complexity analysis of a decentralised graph colouring algor...
Sort
View
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
14 years 8 months ago
Near-perfect load balancing by randomized rounding
We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and m...
Tobias Friedrich, Thomas Sauerwald
IHI
2012
370views Healthcare» more  IHI 2012»
12 years 3 months ago
FUSE: a system for data-driven multi-level functional summarization of protein interaction networks
Despite recent progress in high-throughput experimental studies, systems level visualization and analysis of large protein interaction networks (ppi) remains a challenging task, g...
Boon-Siew Seah, Sourav S. Bhowmick, Charles Forbes...
PODC
2005
ACM
14 years 1 months ago
Maximal independent sets in radio networks
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
Thomas Moscibroda, Roger Wattenhofer
SPAA
2005
ACM
14 years 1 months ago
Fast construction of overlay networks
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...
Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu...
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
14 years 1 months ago
Some novel locality results for the blob code spanning tree representation
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
Tim Paulden, David K. Smith