Talk:Count-distinct problem
 | This article has not yet been rated on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | |||||||||||||||||
| ||||||||||||||||||
[Untitled]
editHi, 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)
CVM algorithm; initial value of "p"?
editThere'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)
- Must be 1 according to Knuth's paper. Retimuko (talk) 20:01, 19 May 2024 (UTC)
- In the CVM paper Algorithm 1, line 1, states: `Initialise p <- 1;`
- Paddy (talk) 20:52, 28 May 2024 (UTC)
CVM algo: halving p
editFixed assignment to p. Needs to be outside the while loop. [1]
CVM algorithms: adding u to data structure
editI 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)