In this paper, we design the optimal precoding matrices for amplify-and-forward (AF) multiple-input multipleoutput (MIMO) relay networks. Specifically, we consider a dualhop relay ...
Upper and lower bounds are obtained for the joint entropy of a collection of random variables in terms of an arbitrary collection of subset joint entropies. These inequalities gene...
We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexit...
The round complexity of interactive protocols is one of their most important complexity measures. In this work we prove that existing lower bounds for the round complexity of VSS c...
Arpita Patra, Ashish Choudhary, Tal Rabin, C. Pand...
We study sparse principal components analysis in the high-dimensional setting, where p (the number of variables) can be much larger than n (the number of observations). We prove o...