3208 search results - page 402 / 642 » A Lower Bound for Primality |
173
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...
158
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...
146
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Sparse methods for supervised learning aim at finding good linear predictors from as few variables as possible, i.e., with small cardinality of their supports. This combinatorial ...
133
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Circular words are cyclically ordered finite sequences of letters. We give a computer-free proof of the following result by Currie: square-free circular words over the ternary alp...