Sciweavers

1497 search results - page 160 / 300
» A Computational Model for Message Passing
Sort
View
TON
2002
175views more  TON 2002»
13 years 7 months ago
Compressed bloom filters
A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries. Although Bloom filters allow false positives, f...
Michael Mitzenmacher
IEEEHPCS
2010
13 years 6 months ago
Extending the educational scope of a particle-based simulation framework through parallelization
Particle systems have been incorporated into a wide variety of applications in both academia and industry. They can be employed to investigate complex natural phenomena, illustrat...
T. Francis Chen, Gladimir V. G. Baranoski
CORR
2011
Springer
149views Education» more  CORR 2011»
13 years 3 months ago
Solving k-Set Agreement with Stable Skeleton Graphs
In this paper we consider the k-set agreement problem in distributed round-based systems where processes communicate by message passing. We capture the synchrony and reliability o...
Martin Biely, Peter Robinson, Ulrich Schmid
TIT
2010
170views Education» more  TIT 2010»
13 years 2 months ago
Belief propagation estimation of protein and domain interactions using the sum-product algorithm
We present a novel framework to estimate protein-protein (PPI) and domain-domain (DDI) interactions based on a belief propagation estimation method that efficiently computes inter...
Faruck Morcos, Marcin Sikora, Mark S. Alber, Dale ...
ADHOCNOW
2008
Springer
13 years 9 months ago
Optimal Gathering Algorithms in Multi-hop Radio Tree-Networks ith Interferences
We study the problem of gathering information from the nodes of a multi-hop radio network into a pre-defined destination node under the interference constraints. In such a network...
Jean-Claude Bermond, Min-Li Yu