Pages that link to "Item:Q2911701"
From MaRDI portal
The following pages link to A statistical analysis of probabilistic counting algorithms (Q2911701):
Displaying 10 items.
- Optimizing the confidence bound of count-min sketches to estimate the streaming big data query results more precisely (Q783053) (← links)
- Probabilistic counting algorithms for data base applications (Q1069325) (← links)
- An analysis of Monte Carlo algorithms for counting problems (Q1083200) (← links)
- A result in order statistics related to probabilistic counting (Q1308501) (← links)
- Winograd's algorithm statistically revisited: it pays to weigh than to count! (Q2383729) (← links)
- Data streams as random permutations: the distinct element problem (Q2920864) (← links)
- Distinct Counting With a Self-Learning Bitmap (Q3111182) (← links)
- (Q3489457) (← links)
- A statistical analysis of the towers of hanoi problem (Q3815308) (← links)
- Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making (Q5463919) (← links)