Random sampling for estimating the performance of fast summations

Simple item page
dc.contributor.authorSrinivasan, Balaji Vasan
dc.contributor.authorDuraiswami, Ramani
dc.date.accessioned2010-10-19T23:06:53Z
dc.date.available2010-10-19T23:06:53Z
dc.date.issued2010-10-18
dc.description.abstractSummation of functions of N source points evaluated at M target points occurs 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.en_US
dc.identifier.urihttp://hdl.handle.net/1903/10976
dc.language.isoen_USen_US
dc.relation.ispartofseriesUM Computer Science Department;CS-TR-4969
dc.titleRandom sampling for estimating the performance of fast summationsen_US
dc.typeTechnical Reporten_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
CS-TR-4969.pdf
Size:
56.99 KB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.8 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Technical Reports of the Computer Science Department