Estimating the number of active flows in a data stream over a sliding window

DOI10.1137/1.9781611972979.9MaRDI QIDQ5194615zbMATH OpenOpenAlexFDO

Authors Éric Fusy, Frécéric Giroire

Publication date 16 September 2019

Published in 2007 Proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/b1ab49844574a8e1dd15257754fa2edc7eebca8c

Mathematics Subject Classification ID

Theory of data (68P99) Combinatorics in computer science (68R05)

Recommendations

• scientific article; zbMATH DE number 2119721
• Maintaining Stream Statistics over Sliding Windows
• Distributed streams algorithms for sliding windows
• Algorithms and estimators for summarization of unaggregated data streams
• scientific article; zbMATH DE number 1947405

Cited in

(8)

• Order statistics and estimating cardinalities of massive data sets
• Approximate query processing over static sets and sliding windows
• Give me some slack: efficient network measurements
• Estimating the size of a hidden finite set: large-sample behavior of estimators
• scientific article; zbMATH DE number 1947405 (Why is no real title available?)
• A unified scheme for generalizing cardinality estimators to sum aggregation
• Brief announcement: Give me some slack: efficient network measurements
• Give me some slack: efficient network measurements

This page was built for publication: Estimating the number of active flows in a data stream over a sliding window

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