A scheme that hashes indices to Lévy processes and invokes the Lévy-Khintchine theorem unifies prior sketches for f-moment estimation and extends tractability to many nearly periodic functions.
HyperLogLog: the analysis of a near-optimal cardinality estimation algorithm
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Unified Construction of Streaming Sketches via the L\'evy-Khintchine Representation Theorem
A scheme that hashes indices to Lévy processes and invokes the Lévy-Khintchine theorem unifies prior sketches for f-moment estimation and extends tractability to many nearly periodic functions.