Frank R. Libsch, S.C. Lien
IBM J. Res. Dev
We study the (constrained) least-squares regression as well as multiple response least-squares regression and ask the question of whether a subset of the data, a coreset, suffices to compute a good approximate solution to the regression. We give deterministic, low-order polynomial-time algorithms to construct such coresets with approximation guarantees, together with lower bounds indicating that there is not much room for improvement upon our results. © 1963-2012 IEEE.
Frank R. Libsch, S.C. Lien
IBM J. Res. Dev
John M. Boyer, Charles F. Wiecha
DocEng 2009
Liqun Chen, Matthias Enzmann, et al.
FC 2005
Reena Elangovan, Shubham Jain, et al.
ACM TODAES