Arun Viswanathan, Nancy Feldman, et al.
IEEE Communications Magazine
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.
Arun Viswanathan, Nancy Feldman, et al.
IEEE Communications Magazine
Ziyang Liu, Sivaramakrishnan Natarajan, et al.
VLDB
Michael C. McCord, Violetta Cavalli-Sforza
ACL 2007
Michael D. Moffitt
ICCAD 2009