3415 search results - page 431 / 683 » Lower bounds on kernelization |
173
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We solve the problem of minimizing the number of critical points among all functions on a surface within a prescribed distance from a given input function. The result is achieved...
174
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
A local algorithm is a distributed algorithm that completes after a constant number of synchronous communication rounds. We present local approximation algorithms for the minimum ...
172
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
In their paper on the "chasm at depth four", Agrawal and Vinay have shown that polynomials in m variables of degree O(m) which admit arithmetic circuits of size 2o(m) al...
133
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Protocol sequences are used for channel access in the collision channel without feedback. Each user accesses the channel according to a deterministic zero-one pattern, called the p...
155
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
A belief-propagation decoder for low-density lattice codes, which represents messages explicitly as a mixture of Gaussians functions, is given. In order to prevent the mixture elem...