Optimal Approximations of the Frequency Moments
| dc.date.accessioned | 2005-12-22T01:35:22Z | |
| dc.date.accessioned | 2018-11-24T10:24:11Z | |
| dc.date.available | 2005-12-22T01:35:22Z | |
| dc.date.available | 2018-11-24T10:24:11Z | |
| dc.date.issued | 2004-07-02 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/30483 | |
| dc.identifier.uri | http://repository.aust.edu.ng/xmlui/handle/1721.1/30483 | |
| 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. | |
| dc.format.extent | 18 p. | |
| dc.format.extent | 18493060 bytes | |
| dc.format.extent | 833343 bytes | |
| dc.language.iso | en_US | |
| dc.subject | AI | |
| dc.title | Optimal Approximations of the Frequency Moments |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
| MIT-CSAIL-TR-2004-044.pdf | 833.3Kb | application/pdf | View/ |
| MIT-CSAIL-TR-2004-044.ps | 18.49Mb | application/postscript | View/ |