Rafae Bhatti, Elisa Bertino, et al.
Communications of the ACM
A greedy algorithm for a class of convex optimization problems is presented in this paper. The algorithm is motivated from function approximation using sparse combination of basis functions as well as some of its variants. We derive a bound on the rate of approximate minimization for this algorithm, and present examples of its application. Our analysis generalizes a number of earlier studies.
Rafae Bhatti, Elisa Bertino, et al.
Communications of the ACM
Kaoutar El Maghraoui, Gokul Kandiraju, et al.
WOSP/SIPEW 2010
Alfonso P. Cardenas, Larry F. Bowman, et al.
ACM Annual Conference 1975
Minkyong Kim, Zhen Liu, et al.
INFOCOM 2008