Conference paper
FPGA-based coprocessor for text string extraction
N.K. Ratha, A.K. Jain, et al.
Workshop CAMP 2000
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.
N.K. Ratha, A.K. Jain, et al.
Workshop CAMP 2000
Limin Hu
IEEE/ACM Transactions on Networking
Thomas M. Cheng
IT Professional
Indranil R. Bardhan, Sugato Bagchi, et al.
JMIS