5785 search results - page 443 / 1157 » Approximability of Probability Distributions |
114
click to vote
INFOCOM
2005
IEEE
16 years 12 days ago
2005
IEEE
— In this paper, we consider the throughput modelling and fairness provisioning in CSMA/CA based ad-hoc networks. The main contributions are: Firstly, a throughput model based on...
181
click to vote
HLK
2003
IEEE
16 years 3 days ago
2003
IEEE
In some applications objects are known to have nonsmooth or “jagged” edges, which are not well approximated by smooth curves. We use subdivision curves as a simple but flexib...
138
Voted
RANDOM
1998
Springer
15 years 11 months ago
1998
Springer
abstract for submission to Random '98 not for distribution Andrei Z. Broder Moses Charikar Michael Mitzenmacher Min-wise independence is a recently introduced notion of limit...
175
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
Abstract Packet-scheduling is a particular challenge in wireless networks due to interference from nearby transmissions. A distance-2 interference model serves as a useful abstract...
199
click to vote
ATAL
2010
Springer
15 years 8 months ago
2010
Springer
Robotic swarms, like all spatial computers, are a challenging environment for the execution of distributed consensus algorithms due to their scale, diameter, and frequent failures...