A space-optimal data-stream algorithm for coresets in the plane
From MaRDI portal
Publication:3602850
Recommendations
- An almost space-optimal streaming algorithm for coresets in fixed dimensions
- An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed Dimensions
- Simplified Planar Coresets for Data Streams
- Faster core-set constructions and data stream algorithms in fixed dimensions
- Faster core-set constructions and data-stream algorithms in fixed dimensions
- A streaming algorithm for \(k\)-means with approximate coreset
- scientific article; zbMATH DE number 6297803
- Streaming algorithms for extent problems in high dimensions
- scientific article; zbMATH DE number 7650129
- Dynamic graph stream algorithms in \(o(n)\) space
Cited in
(13)- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Dynamic coresets
- An almost space-optimal streaming algorithm for coresets in fixed dimensions
- Dynamic streaming algorithms for \(\varepsilon\)-kernels
- Robust shape fitting via peeling and grating coresets
- Streaming algorithms for line simplification
- Simplified Planar Coresets for Data Streams
- An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed Dimensions
- Approximate convex hull of data streams
- Streaming algorithms for extent problems in high dimensions
- A streaming algorithm for 2-center with outliers in high dimensions
- Efficient observer-dependent simplification in polygonal domains
- Streaming and dynamic algorithms for minimum enclosing balls in high dimensions
This page was built for publication: A space-optimal data-stream algorithm for coresets in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3602850)
