Distinct Elements in Streams: An Algorithm for the (Text) Book

Given a data stream \(\mathcal{A} = \langle a_1, a_2, \ldots, a_m \rangle\) of \(m\) elements where each \(a_i \in [n]\), the Distinct Elements problem is to estimate the number of distinct elements in \(\mathcal{A}\).Distinct Elements has been a subject of theoretical and empirical investigations o...

Celý popis

Podrobná bibliografia

Vydané v:	arXiv.org
Hlavní autori:	Chakraborty, Sourav, Vinodchandran, N V, Meel, Kuldeep S
Médium:	Paper
Jazyk:	English
Vydavateľské údaje:	Ithaca Cornell University Library, arXiv.org 24.05.2023
Predmet:	Data transmission Hash based algorithms Probability theory
ISSN:	2331-8422
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!