Finding Heavy Hitters from Lossy or Noisy Data

DOI10.1007/978-3-642-40328-6_25zbMath1405.68276OpenAlexW2168561001MaRDI QIDQ2851870

Russell Impagliazzo, Ramamohan Paturi, Cody D. Murray, Lucia Batman

Publication date: 4 October 2013

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40328-6_25

zbMATH Keywords

enumeration of heavy hitterslearning discrete distributionspopulation recovery

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (1)

Population recovery and partial identification

This page was built for publication: Finding Heavy Hitters from Lossy or Noisy Data