530 search results - page 67 / 106 » Bounds on marginal probability distributions |
USS
2008
13 years 10 months ago
2008
We address the problem of auditing an election when precincts may have different sizes. Prior work in this field has emphasized the simpler case when all precincts have the same s...
ISPDC
2008
IEEE
14 years 2 months ago
2008
IEEE
Self-stabilizing token circulation algorithms are not always adapted for dynamic networks. Random walks are well known to play a crucial role in the design of randomized algorithm...
SPDP
1991
IEEE
13 years 11 months ago
1991
IEEE
In this paper, we present a randomized algorithm for the multipacket (i.e., k − k) routing problem on an n × n mesh. The algorithm completes with high probability in at the mos...
SODA
2004
ACM
13 years 9 months ago
2004
ACM
In this paper, we give results relevant to sequential and distributed dynamic data structures for finding nearest neighbors in growth-restricted metrics. Our sequential data struc...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
—This paper addresses three issues in the field of ad hoc network capacity: the impact of i) channel fading, ii) channel inversion power control, and iii) threshold–based sche...