CORR
2006
Springer
13 years 11 months ago
2006
Springer
Despite the apparent similarity between shared randomness and shared entanglement in the context of Communication Complexity, our understanding of the latter is not as good as of ...
CORR
2006
Springer
13 years 11 months ago
2006
Springer
CORR
2006
Springer
13 years 11 months ago
2006
Springer
For p n, let b (n) 1 , . . . , b (n) p be independent random vectors in Rn with the same distribution invariant by rotation and without mass at the origin. Almost surely these vec...
CORR
2006
Springer
13 years 11 months ago
2006
Springer
We consider semi-supervised classification when part of the available data is unlabeled. These unlabeled data can be useful for the classification problem when we make an assumpti...
CORR
2006
Springer
13 years 11 months ago
2006
Springer
CORR
2006
Springer
13 years 11 months ago
2006
Springer
CORR
2006
Springer
13 years 11 months ago
2006
Springer
We consider a communication scenario in which the primary and the cognitive radios wish to communicate to different receivers, subject to mutual interference. In the model that we...
CORR
2006
Springer
13 years 11 months ago
2006
Springer
We propose algorithms for the computation of the first N terms of a vector (or a full basis) of power series solutions of a linear system of differential equations at an ordinary ...
CORR
2006
Springer
13 years 11 months ago
2006
Springer
Abstract -We investigate the achievable rate of data transmission from sources to sinks through a multiple-relay network. We study achievable rates for omniscient coding, in which ...
CORR
2006
Springer
13 years 11 months ago
2006
Springer
In this paper, we investigate achievable rates on the multiple access channel with feedback and correlated sources (MACFCS). The motivation for studying the MACFCS stems from the ...