Talk:Approximate counting algorithm: Difference between revisions
Appearance
Content deleted Content added
→Recent developments: new section |
m Signing comment by Herojoker - "→Recent developments: new section" |
||
Line 9: | Line 9: | ||
== Recent developments == |
== Recent developments == |
||
Developments like the HyperLogLog algorithm (see [http://highscalability.com/blog/2012/4/5/big-data-counting-how-to-count-a-billion-distinct-objects-us.html highscalability.com]) should perhaps be included. |
Developments like the HyperLogLog algorithm (see [http://highscalability.com/blog/2012/4/5/big-data-counting-how-to-count-a-billion-distinct-objects-us.html highscalability.com]) should perhaps be included. <small><span class="autosigned">— Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:Herojoker|Herojoker]] ([[User talk:Herojoker|talk]] • [[Special:Contributions/Herojoker|contribs]]) 22:42, 26 August 2012 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot--> |
Revision as of 22:44, 26 August 2012
This is the talk page for discussing improvements to the Approximate counting algorithm article. This is not a forum for general discussion of the article's subject. |
Article policies
|
Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL |
![]() | Articles for creation Start‑class ![]() | |||||||||
|
Coin tossing
Is it really necessary to toss the coin N times for a counter with value N on every event just to see if they're all heads? Couldn't we stop as soon as a tail is observed? -- Ralph Corderoy (talk) 08:28, 6 July 2011 (UTC)
Actually you don't need multiple tosses at all. Simply generate a random number and take it modulo 2^V, where V is the current value. If the modulo is 0, then increment the counter. --CAFxX (talk) 15:14, 4 January 2012 (UTC)
Recent developments
Developments like the HyperLogLog algorithm (see highscalability.com) should perhaps be included. — Preceding unsigned comment added by Herojoker (talk • contribs) 22:42, 26 August 2012 (UTC)