Computational geometry: an introduction
Computational geometry: an introduction
Probabilistic counting algorithms for data base applications
Journal of Computer and System Sciences
Space-efficient online computation of quantile summaries
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Approximating extent measures of points
Journal of the ACM (JACM)
Medians and beyond: new aggregation techniques for sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Adaptive sampling for geometric problems over data streams
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
An improved data stream summary: the count-min sketch and its applications
Journal of Algorithms
Data streams: algorithms and applications
Foundations and Trends® in Theoretical Computer Science
A space-optimal data-stream algorithm for coresets in the plane
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Faster core-set constructions and data-stream algorithms in fixed dimensions
Computational Geometry: Theory and Applications
Hi-index | 0.01 |
We propose a simple, optimal-space algorithm for maintaining an extent coreset for a data stream of points in the plane. For a given parameter r, the coreset consists of a sample of 茂戮驴(r) points from the stream seen so far. The coreset property is that for any slab (defined by two parallel lines) that encloses the sample, a (1 + 茂戮驴) expansion of the slab encloses all the stream points seen so far, for 茂戮驴= O(1/r2). The coreset can be maintained in O(logr) amortized time per point of the stream.