Talk:Approximate counting algorithm

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.

Put new text under old text. Click here to start a new topic.
New to Wikipedia? Welcome! Learn to edit; get help.

Article policies

Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL

Articles for creation Start‑class

	This article was reviewed by member(s) of WikiProject Articles for creation. The project works to allow users to contribute quality articles and media files to the encyclopedia and track their progress as they are developed. To participate, please visit the project page for more information.Articles for creationWikipedia:WikiProject Articles for creationTemplate:WikiProject Articles for creationAfC
Start	This article has been rated as Start-class on Wikipedia's content assessment scale.
	This article was accepted on 8 November 2008 by reviewer Graeme Bartlett (talk · contribs).

Computer science Start‑class Low‑importance

This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science

Start

This article has been rated as Start-class on Wikipedia's content assessment scale.

Low

This article has been rated as Low-importance on the project's importance scale.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

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)[reply]

No, you could have multiple tails. All the best: Rich Farmbrough, 16:52, 17 October 2018 (UTC).[reply]

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)[reply]

This would be true if you knew the value. The point is that you don't, you only have the previous approximation, and knowledge that another instance has occured. Certainly if you have a run of X you might be able to optimise. All the best: Rich Farmbrough, 16:52, 17 October 2018 (UTC).[reply]

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) http://blog.notdot.net/2012/09/Dam-Cool-Algorithms-Cardinality-Estimation <= This is a great description of the algorithm — Preceding unsigned comment added by 173.252.71.4 (talk) 23:24, 22 January 2013 (UTC)[reply]

External links modified

Hello fellow Wikipedians,

I have just modified one external link on Approximate counting algorithm. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:

Added archive https://web.archive.org/web/20160304042036/http://jupiter.math.nctu.edu.tw/~mfuchs/approx_count_3.pdf to http://jupiter.math.nctu.edu.tw/~mfuchs/approx_count_3.pdf

When you have finished reviewing my changes, please set the checked parameter below to true or failed to let others know (documentation at {{Sourcecheck}}).

This message was posted before February 2018. After February 2018, "External links modified" talk page sections are no longer generated or monitored by InternetArchiveBot. No special action is required regarding these talk page notices, other than regular verification using the archive tool instructions below. Editors have permission to delete these "External links modified" talk page sections if they want to de-clutter talk pages, but see the RfC before doing mass systematic removals. This message is updated dynamically through the template {{source check}} (last update: 5 June 2024).

If you have discovered URLs which were erroneously considered dead by the bot, you can report them with this tool.
If you found an error with any archives or the URLs themselves, you can fix them with this tool.

Cheers.—InternetArchiveBot (Report bug) 16:58, 16 October 2016 (UTC)[reply]