5592 search results - page 794 / 1119 » On Random Betweenness Constraints |
150
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
The capacity region of a wireless network with n nodes is the set of all simultaneously achievable rates between all possible n2 node pairs. In this paper, we consider the questio...
187
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
158
click to vote
ECCC
2010
15 years 6 months ago
2010
An (r, , )-locally decodable code encodes a k-bit message x to an N-bit codeword C(x), such that for every i [k], the i-th message bit can be recovered with probability 1 - , by ...
185
click to vote
ECCC
2010
15 years 6 months ago
2010
We study a variant of the classical circuit-lower-bound problems: proving lower bounds for sampling distributions given random bits. We prove a lower bound of 1 - 1/n(1) on the st...
159
click to vote
EOR
2010
15 years 6 months ago
2010
Traditionally, clustering problems are investigated under the assumption that all objects must be clustered. A shortcoming of this formulation is that a few distant objects, calle...