New algorithms for distributed sliding windows

DOI10.4230/LIPICS.SWAT.2018.22zbMATH Open1477.68530MaRDI QIDQ5116486FDOQ5116486

Authors: Sutanu Gayen, N. V. Vinodchandran 

Publication date: 25 August 2020

Recommendations

• Distributed streams algorithms for sliding windows
• Continuous Monitoring of Distributed Data Streams Over a Time-based Sliding Window
• Continuous monitoring of distributed data streams over a time-based sliding window
• Algorithms for \(k\)-median clustering over distributed streams
• Effective computations on sliding windows

zbMATH Keywords

frequency moments\(k\)-median clusteringdistributed streamingdistributed functional monitoring\(k\)-center clusteringdistributed sliding window

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Online algorithms; streaming algorithms (68W27) Distributed algorithms (68W15)

Cites Work

• Optimal Random Sampling from Distributed Streams Revisited
• Algorithms for k-median Clustering over Distributed Streams
• Title not available (Why is that?)
• Effective computations on sliding windows
• Tight bounds for distributed functional monitoring
• Continuous Monitoring of Distributed Data Streams Over a Time-based Sliding Window
• Clustering Problems on Sliding Windows
• Improved algorithms for distributed entropy monitoring
• Clustering on Sliding Windows in Polylogarithmic Space.
• Title not available (Why is that?)

Cited In (1)

• Effective computations on sliding windows

This page was built for publication: New algorithms for distributed sliding windows

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