@article {13950,
	title = {Random sampling for estimating the performance of fast summations},
	journal = {Technical Reports of the Computer Science Department},
	year = {2010},
	month = {2010/10/18/},
	abstract = {Summation of functions of N source points evaluated at M target pointsoccurs commonly in many applications. To scale these approaches for large
datasets, many fast algorithms have been proposed. In this technical report, we
propose a Chernoff bound based efficient approach to test the performance of a
fast summation algorithms providing a probabilistic accuracy. We further
validate and use our approach in separate comparisons.
},
	keywords = {Technical Report},
	url = {http://drum.lib.umd.edu/handle/1903/10976},
	author = {Srinivasan,Balaji Vasan and Duraiswami, Ramani}
}
