725 search results - page 36 / 145 » Bounding Degrees on RPL |
151
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We obtain a lower bound of n 1 k+1 22k (k-1)2k-1 on the k-party randomized communication complexity of the Disjointness function in the `Number on the Forehead' model of mul...
150
click to vote
RSA
2011
15 years 1 months ago
2011
We prove that for fixed integer D and positive reals α and γ, there exists a constant C0 such that for all p satisfying p(n) ≥ C0/n, the random graph G(n, p) asymptotically a...
151
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
This paper proposes a method to optimize the performance of tandem source–channel coding with respect to the mean-squared error by exploiting the unequal error protection coding...
182
click to vote
IACR
2011
14 years 5 months ago
2011
Keccak is one of the five hash functions selected for the final round of the SHA-3 competition and its inner primitive is a permutation called Keccakf. In this paper, we find t...
164
click to vote
SODA
1997
ACM
15 years 7 months ago
1997
ACM
We give a polynomial-time algorithm for the following problem: Given a degree sequence in which each degree is bounded from above by a constant, select, uniformly at random, an un...