Talk:Count-distinct problem

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

???

This article has not yet received a rating 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}}

[Untitled]

Hi, I created a page titled "Weighted Cardinality Estimation", I want to rename it so I created another page with the same content titled "Count-Distinct Problem".

Please delete the "Weighted Cardinality Estimation" and keep the "Count-Distinct Problem" page - this should be the page's name.

Thank you, Aviv

I've moved the page for you. Tutelary (talk) 22:39, 15 October 2014 (UTC)[reply]

CVM algorithm; initial value of "p"?

There's a seemingly clear definition of the CVM algorithm using pseudo-code. Problem: there's no apparent initial value for the variable "p" (a probability threshold). What should it be? -- Dan Griscom (talk) 22:52, 18 May 2024 (UTC)[reply]

Must be 1 according to Knuth's paper. Retimuko (talk) 20:01, 19 May 2024 (UTC)[reply]

In the CVM paper Algorithm 1, line 1, states: `Initialise p <- 1;`

Paddy (talk) 20:52, 28 May 2024 (UTC)[reply]

CVM algo: halving p

Fixed assignment to p. Needs to be outside the while loop. ^[1]

Paddy (talk) 20:38, 28 May 2024 (UTC)[reply]

References

^ https://paddy3118.blogspot.com/2024/05/recreating-cvm-algorithm-for-estimating.html

CVM algorithms: adding u to data structure

I don't think there's any need to add u to the dictionary data structure (since it never gets used by the CVM algorithm). I believe it gets used in a CVM variant presented by Knuth (that deletes only 1 element at a time using treaps). 72.82.224.191 (talk) 11:47, 21 June 2024 (UTC)[reply]

CVM algorithm: Knuth's version or not?

The text claimed to present a modification by Knuth, but reading https://www-cs-faculty.stanford.edu/~knuth/papers/cvm-note.pdf his modification resulted in algorithm D, while algorithm X was the original one with a biased estimate. I've changed the page to show algorithm D and added algorithm D' as improvement of D. — Preceding unsigned comment added by Pychron (talk • contribs) 08:22, 13 November 2024 (UTC)[reply]

[1] ttps://paddy3118.blogspot.com/2024/05/recreating-cvm-algorithm-for-estimating.html

[1]