2945 search results - page 10 / 589 » Noisy Network Coding |
139
Voted
COCO
2011
Springer
14 years 1 months ago
2011
Springer
Let f ∈ Fq[x] be a polynomial of degree d ≤ q/2. It is well-known that f can be uniquely recovered from its values at some 2d points even after some small fraction of the valu...
72
Voted
ADCM
2000
15 years 1 months ago
2000
This paper is devoted to the analysis of network approximation in the framework of approximation and regularization theory. It is shown that training neural networks and similar n...
84
Voted
SENSYS
2004
ACM
15 years 7 months ago
2004
ACM
112
click to vote
ICNSC
2007
IEEE
15 years 8 months ago
2007
IEEE
—This paper studies the problem of understanding noisy and structurally deformed two-dimensional images by means of abstractly defined neural works. First, in the framework of sy...
CORR
2010
Springer
15 years 2 months ago
2010
Springer
The capacity region of a broadcast channel consisting of k-receivers that lie in a less noisy sequence is an open problem, when k 3. We prove that superposition coding is indeed ...