5592 search results - page 815 / 1119 » On Random Betweenness Constraints |
195
click to vote
INFOCOM
2011
IEEE
14 years 10 months ago
2011
IEEE
—In this work, for a wireless sensor network (WSN) of n randomly placed sensors with node density λ ∈ [1, n], we study the tradeoffs between the aggregation throughput and gat...
215
click to vote
INFOCOM
2011
IEEE
14 years 10 months ago
2011
IEEE
—The multiple-access framework of ZigZag decoding [1] is a useful technique for combating interference via multiple repeated transmissions, and is known to be compatible with dis...
203
click to vote
QUESTA
2011
14 years 9 months ago
2011
: This paper studies the asymptotic behavior of the steady-state waiting time, W∞, of the M/G/1 queue with subexponenential processing times for different combinations of traffi...
281
click to vote
IVC
2008
15 years 6 months ago
2008
Reversible jump Markov chain Monte Carlo (RJMCMC) is a recent method which makes it possible to construct reversible Markov chain samplers that jump between parameter subspaces of...
252
click to vote
JMLR
2012
13 years 9 months ago
2012
We prove logarithmic regret bounds that depend on the loss L∗ T of the competitor rather than on the number T of time steps. In the general online convex optimization setting, o...