Simplified Planar Coresets for Data Streams
From MaRDI portal
Publication:3512444
DOI10.1007/978-3-540-69903-3_3zbMath1155.68558OpenAlexW1602583635MaRDI QIDQ3512444
Subhash Suri, J. E. Hershberger
Publication date: 15 July 2008
Published in: Algorithm Theory – SWAT 2008 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-69903-3_3
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Probabilistic counting algorithms for data base applications
- Adaptive sampling for geometric problems over data streams
- Faster core-set constructions and data-stream algorithms in fixed dimensions
- Approximating extent measures of points
- A space-optimal data-stream algorithm for coresets in the plane
- An improved data stream summary: the count-min sketch and its applications
This page was built for publication: Simplified Planar Coresets for Data Streams
