We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an o...
act 11 We address the problem of designing a network built on several layers. This problem occurs in practical applications 12 but has not been studied extensively from the point o...
It is shown that the minimum cut ratio is within a factor of O(log k) of the maximum concurrent flow for k-commodity flow instances with arbitrary capacities and demands. This im...
Compressive sensing (CS) is an alternative to Shannon/Nyquist sampling for acquisition of sparse or compressible signals that can be well approximated by just K N elements from a...
Richard G. Baraniuk, Volkan Cevher, Marco F. Duart...
The recent popularization of social web services has made them one of the primary uses of the World Wide Web. An important concept in social web services is social actions such as...