Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,299 papers from all fields of science
Search
Sign In
Create Free Account
Approximate counting algorithm
The approximate counting algorithm allows the counting of a large number of events using a small amount of memory. Invented in 1977 by Robert Morris…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
5 relations
Artificial intelligence
Counter (digital)
Data compression
List of algorithms
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Sketching and streaming — Notes 2
Jelani Nelson
2016
Corpus ID: 7336788
Distinct elements (F0). In this note we will consider the distinct elements problem, also known as the F0 problem, defined as…
Expand
2009
2009
FIA: Frequent Itemsets Mining Based on Approximate Counting in Data Streams
Younghee Kim
,
Joonsuk Ryu
,
U. Kim
International Conference on Neural Information…
2009
Corpus ID: 42903342
In this paper, we consider the problem of frequent elements over data stream seeks the set of items whose frequency exceeds ?N…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE