Simplified Planar Coresets for Data Streams

DOI10.1007/978-3-540-69903-3_3MaRDI QIDQ3512444zbMATH OpenOpenAlexFDO

Authors John Hershberger, Subhash Suri

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

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• A space-optimal data-stream algorithm for coresets in the plane
• An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed Dimensions
• Dynamic coresets
• An almost space-optimal streaming algorithm for coresets in fixed dimensions
• Probabilistic k-median clustering in data streams

Cites work

• A space-optimal data-stream algorithm for coresets in the plane
• Adaptive sampling for geometric problems over data streams
• An improved data stream summary: the count-min sketch and its applications
• Approximating extent measures of points.
• Data streams: algorithms and applications.
• Faster core-set constructions and data-stream algorithms in fixed dimensions
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• scientific article; zbMATH DE number 1433426 (Why is no real title available?)
• scientific article; zbMATH DE number 5019895 (Why is no real title available?)
• Probabilistic counting algorithms for data base applications

Cited in

(2)

• A space-optimal data-stream algorithm for coresets in the plane
• Dynamic coresets

This page was built for publication: Simplified Planar Coresets for Data Streams

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3512444)