2021
DOI: 10.48550/arxiv.2110.15533
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Improved Sliding Window Algorithms for Clustering and Coverage via Bucketing-Based Sketches

Abstract: Streaming computation plays an important role in large-scale data analysis. The sliding window model is a model of streaming computation which also captures the recency of the data. In this model, data arrives one item at a time, but only the latest W data items are considered for a particular problem. The goal is to output a good solution at the end of the stream by maintaining a small summary during the stream.In this work, we propose a new algorithmic framework for designing efficient sliding window algorit… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 16 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?