Estimating the number of Active Flows in a Data Stream over a Sliding Window

DOI10.1137/1.9781611972979.9zbMath1430.68105OpenAlexW98727202MaRDI QIDQ5194615

É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

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

Related Items (7)

Unnamed Item ⋮ Unnamed Item ⋮ A unified scheme for generalizing cardinality estimators to sum aggregation ⋮ 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 ⋮ Order statistics and estimating cardinalities of massive data sets

This page was built for publication: Estimating the number of Active Flows in a Data Stream over a Sliding Window