Optimal Approximations of the Frequency Moments
| dc.date.accessioned | 2004-10-08T20:43:17Z | |
| dc.date.accessioned | 2018-11-24T10:21:44Z | |
| dc.date.available | 2004-10-08T20:43:17Z | |
| dc.date.available | 2018-11-24T10:21:44Z | |
| dc.date.issued | 2004-07-02 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/6741 | |
| dc.identifier.uri | http://repository.aust.edu.ng/xmlui/handle/1721.1/6741 | |
| dc.description.abstract | We give a one-pass, O~(m^{1-2/k})-space algorithm for estimating the k-th frequency moment of a data stream for any real k>2. Together with known lower bounds, this resolves the main problem left open by Alon, Matias, Szegedy, STOC'96. Our algorithm enables deletions as well as insertions of stream elements. | en_US |
| dc.format.extent | 18 p. | en_US |
| dc.format.extent | 3705201 bytes | |
| dc.format.extent | 761567 bytes | |
| dc.language.iso | en_US | |
| dc.subject | AI | en_US |
| dc.title | Optimal Approximations of the Frequency Moments | en_US |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
| AIM-2004-014.pdf | 761.5Kb | application/pdf | View/ |
| AIM-2004-014.ps | 3.705Mb | application/postscript | View/ |