Let G1 be a cyclic multiplicative group of order n. It is known that the Diffie-Hellman problem is random self-reducible in G1 with respect to a fixed generator g if (n) is known....
We provide a complete characterization of the rate-distortion region for the multistage successive refinement of the Wyner-Ziv source coding problem with degraded side information...
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 ...
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...
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...
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...
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 ...