3055 search results - page 377 / 611 » Randomized Search Trees |
146
click to vote
SODA
2008
ACM
15 years 5 months ago
2008
ACM
We show a tight lower bound of (N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors...
164
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...
138
click to vote
ICMCS
2008
IEEE
15 years 10 months ago
2008
IEEE
The existing DONet-based approach uses successfully a random gossip algorithm for scalable live video streaming. This pure mesh overlay network-based solution may lead to unaccept...
149
click to vote
DSN
2007
IEEE
15 years 10 months ago
2007
IEEE
In epidemic or gossip-based multicast protocols, each node simply relays each message to some random neighbors, such that all destinations receive it at least once with high proba...
120
click to vote
SBACPAD
2007
IEEE
15 years 10 months ago
2007
IEEE
We present node level primitives for parallel exact inference on an arbitrary Bayesian network. We explore the probability representation on each node of Bayesian networks and eac...