Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
10
click to vote
TALG
2010
favorite
Email
discuss
report
82
views
more
TALG 2010
»
A near-optimal algorithm for estimating the entropy of a stream
13 years 4 months ago
Download
www.cs.dartmouth.edu
Amit Chakrabarti, Graham Cormode, Andrew McGregor
Real-time Traffic
TALG 2010
|
claim paper
Related Content
»
NearOptimal Lower Bounds on the MultiParty Communication Complexity of Set Disjointness
»
Estimating Entropy and Entropy Norm on Data Streams
»
Sketching and Streaming Entropy via Approximation Theory
»
A data streaming algorithm for estimating entropies of od flows
»
Data streaming algorithms for estimating entropy of network traffic
»
Estimating Entropy over Data Streams
»
CRprecis A Deterministic Summary Structure for Update Data Streams
»
A Very Efficient Scheme for Estimating Entropy of Data Streams Using Compressed Counting
»
An optimal algorithm for the distinct elements problem
more »
Post Info
More Details (n/a)
Added
30 Jan 2011
Updated
30 Jan 2011
Type
Journal
Year
2010
Where
TALG
Authors
Amit Chakrabarti, Graham Cormode, Andrew McGregor
Comments
(0)
Researcher Info
TALG 2008 Study Group
Computer Vision