2084 search results - page 273 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
162
click to vote
INFOCOM
2006
IEEE
16 years 14 days ago
2006
IEEE
— We consider the fundamental delay tradeoffs for minimizing energy expenditure in a multi-user wireless downlink with randomly varying channels. First, we extend the BerryGallag...
162
click to vote
UAI
2004
15 years 7 months ago
2004
We introduce a probabilistic formalism subsuming Markov random fields of bounded tree width and probabilistic context free grammars. Our models are based on a representation of Bo...
197
click to vote
INFORMATICALT
2006
15 years 6 months ago
2006
Generally, the task in a distributed system must achieve an agreement. It requires a set of processors to agree on a common value even if some components are corrupted. There are s...
161
click to vote
JSAC
2008
15 years 6 months ago
2008
We consider a wireless collision channel, shared by a finite number of users who transmit to a common base station. Each user wishes to minimize its average transmission rate (or p...
174
click to vote
COLT
1992
Springer
15 years 10 months ago
1992
Springer
Language learning from positive data in the Gold model of inductive inference is investigated in a setting where the data can be modeled as a stochastic process. Specifically, the...