6393 search results - page 387 / 1279 » Randomized Algorithms on the Mesh |
172
click to vote
OPODIS
2008
15 years 8 months ago
2008
Kleinberg [17] proposed in 2000 the first random graph model achieving to reproduce small world navigability, i.e. the ability to greedily discover polylogarithmic routes between a...
214
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
Estimating frequency moments and Lp distances are well studied problems in the adversarial data stream model and tight space bounds are known for these two problems. There has been...
204
click to vote
NOSSDAV
2009
Springer
16 years 1 months ago
2009
Springer
Peer-to-peer distributed virtual environments (DVE's) distribute state tracking and state transitions. Many DVE's - such as online games - require ways to fairly determi...
189
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
Abstract— In this paper, we propose an unequal error protection (UEP) framework for progressive image transmission over wireless networks with both random errors and packet loss....
179
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
— The present paper investigates practical algorithms to efficiently exploit random network coding for data delivery in multi-hop wireless networks. In the past few years, a gre...