501 search results - page 38 / 101 » Communication Lower Bounds Using Dual Polynomials |
ECCC
2008
13 years 9 months ago
2008
Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Traditional communication theory focuses on minimizing transmit power. However, communication links are increasingly operating at shorter ranges where transmit power can be signif...
CEC
2005
IEEE
14 years 2 months ago
2005
IEEE
We consider the (1+λ) evolution strategy, an evolutionary algorithm for minimization in Rn , using isotropic mutations. Thus, for instance, Gaussian mutations adapted by the 1/5-r...
PODS
2003
ACM
14 years 9 months ago
2003
ACM
We formalize the problem of maintaining time-decaying aggregates and statistics of a data stream: the relative contribution of each data item to the aggregate is scaled down by a ...
ICC
2007
IEEE
14 years 3 months ago
2007
IEEE
— We study the minimum distance of the binary expansion of high-rate Reed-Solomon (RS) codes and product codes in the polynomial basis and show that the binary codes obtained in ...