ARTICLES
1,212 Article(s)
1, 2, 3, 4, 5, 6 >> >|
Document(s)
Title
The problem of estimating the number $n$ of distinct keys of a large collection of $N$ data is well known in computer science. A classical algorithm is the adaptive sampling (AS). $n$ can be estimated by $R.2^D$, where $R$ is the final bucket (cache)...