A Note on Estimating Hybrid Frequency Moment of Data Streams

DOI10.1007/978-3-642-02158-9_18zbMATH Open1246.68117OpenAlexW1938261373MaRDI QIDQ3638451FDOQ3638451

Authors: Sumit Ganguly 

Publication date: 2 July 2009

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02158-9_18

Recommendations

• Estimating hybrid frequency moments of data streams
• Estimating Hybrid Frequency Moments of Data Streams
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• On Estimating Frequency Moments of Data Streams
• Optimal approximations of the frequency moments of data streams

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) General topics in the theory of data (68P01)

Cites Work

• The space complexity of approximating the frequency moments
• Optimal approximations of the frequency moments of data streams
• An improved data stream summary: the count-min sketch and its applications
• An information statistics approach to data stream and communication complexity
• Probabilistic counting algorithms for data base applications
• Title not available (Why is that?)
• Optimal space lower bounds for all frequency moments
• Title not available (Why is that?)
• Estimating Entropy over Data Streams
• Estimating Hybrid Frequency Moments of Data Streams

Cited In (2)

• Estimating hybrid frequency moments of data streams
• Estimating Hybrid Frequency Moments of Data Streams

This page was built for publication: A Note on Estimating Hybrid Frequency Moment of Data Streams

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3638451)