Improved Algorithms for Time Decay Streams
From MaRDI portal
Cites work
- A PTAS for k-means clustering based on weak coresets
- A unified framework for approximating and clustering data
- Better streaming algorithms for clustering problems
- Clustering on sliding windows in polylogarithmic space
- Clustering problems on sliding windows
- Computing diameter in the streaming and sliding-window models
- Coresets and sketches for high dimensional subspace approximation problems
- Data streams: algorithms and applications.
- Data streams. Models and algorithms.
- Decomposable searching problems I. Static-to-dynamic transformation
- Distributed streams algorithms for sliding windows
- Frequent directions: simple and deterministic matrix sketching
- GEOMETRIC OPTIMIZATION PROBLEMS OVER SLIDING WINDOWS
- scientific article; zbMATH DE number 1947403 (Why is no real title available?)
- Maintaining Stream Statistics over Sliding Windows
- Maintaining time-decaying stream aggregates
- Matrix approximation and projective clustering via volume sampling
- Nearly optimal distinct elements and heavy hitters on sliding windows
- Numerical linear algebra in the streaming model
- On Coresets for k-Median and k-Means Clustering in Metric and Euclidean Spaces and Their Applications
- On coresets for k-means and k-median clustering
- Randomized composable core-sets for distributed submodular maximization
- Sampling Algorithms and Coresets for \ell_p Regression
- Streaming k-means on well-clusterable data
- Theoretical Computer Science
- Time-decaying sketches for robust aggregation of sensor data
- Time-decaying sketches for sensor data aggregation
- Turning big data into tiny data: constant-size coresets for k-means, PCA and projective clustering
This page was built for publication: Improved Algorithms for Time Decay Streams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5875480)
