3 ms·
Computer scientists invent a memory-efficient way to estimate the size of a subset
by eterevsky 2y ago
Computer scientists invent a memory-efficient way to estimate the size of a subset
- m3kw9 2y agoIt seems fast too as you can use less rounds of flips and get an estimate meaning you may not need to go thru the entire “book” to get an estimate of distinct words
- deleted 2y ago[deleted]
- seadan83 2y agoThe subset is very important, it is the subset of unique elements.
- Koshkin 2y agoIt's not a "subset," it's "the set of equivalence classes."
- seadan83 2y agoI think it's by definition that the unique elements of a set is a subset. Nonetheless, the clarification is a good point. To take a stab at a yet more correct statement, maybe something like the follows captures it: In the algorithm noted, we are extrapolating the size of the unique elements by looking at additional subsets, which themselves are an equivalence class.
- eterevsky 2y agoThis is implied by the word "set" in "subset". Otherwise it would've been a multiset.