Given a sequence of n real numbers a1, a2, a3, . . . , an, the maximum segment sum problem is that of determining indices i and j (1 ≤ i ≤ j ≤ n) such that the sum s(i, j) =...
— We consider a two transmit antenna broadcast system with heterogeneous users, and tackle the problem of maximizing a weighted sum rate. We establish a novel upper bound for the...
Krishna P. Jagannathan, Sem C. Borst, Philip A. Wh...