Rajiv Ramaswami, Kumar N. Sivarajan
IEEE/ACM Transactions on Networking
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.
Rajiv Ramaswami, Kumar N. Sivarajan
IEEE/ACM Transactions on Networking
Ruixiong Tian, Zhe Xiang, et al.
Qinghua Daxue Xuebao/Journal of Tsinghua University
Raymond Wu, Jie Lu
ITA Conference 2007
Robert C. Durbeck
IEEE TACON