Bottom-k and priority sampling, set similarity and subset sums with minimal independence

DOI10.1145/2488608.2488655zbMath1293.68107arXiv1303.5479OpenAlexW2134212491MaRDI QIDQ5495807

Mikkel Thorup

Publication date: 7 August 2014

Published in: Proceedings of the forty-fifth annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1303.5479

zbMATH Keywords

samplingindependenceestimation

Mathematics Subject Classification ID

Statistical sampling theory and related topics (62D99) Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (5)

Binary vectors for fast distance and similarity estimation ⋮ d-k-min-wise independent family of hash functions ⋮ Fingerprints for highly similar streams ⋮ Real-valued embeddings and sketches for fast distance and similarity estimation ⋮ Unnamed Item

This page was built for publication: Bottom-k and priority sampling, set similarity and subset sums with minimal independence