1612 search results - page 125 / 323 » Analysing Randomized Distributed Algorithms |
115
click to vote
SIGGRAPH
1991
ACM
15 years 8 months ago
1991
ACM
Nonuniform sampling of images is a useful technique in computer graphics, because a properly designed pattern of samples can make aliasing take the form of high-frequency random n...
109
click to vote
ICDCS
2005
IEEE
15 years 10 months ago
2005
IEEE
We study how a server may disseminate a large volume of data to a set of clients in the shortest possible time. We first consider a cooperative scenario where clients are willing...
143
Voted
CORR
2007
Springer
15 years 5 months ago
2007
Springer
— The fairness of IEEE 802.11 wireless networks (including Wireless LAN and Ad-hoc networks) is hard to predict and control because of the randomness and complexity of the MAC co...
147
click to vote
ACL
2011
14 years 8 months ago
2011
This paper presents an attempt at building a large scale distributed composite language model that simultaneously accounts for local word lexical information, mid-range sentence s...
123
Voted
WDAG
1990
Springer
15 years 9 months ago
1990
Springer
Traditional problems in distributed systems include the Reliable Broadcast, Distributed Consensus, and Distributed Firing Squad problems. These problems require coordination only ...