The following pages link to Sampling algorithms (Q5175979):
Displaying 14 items.
- Optimal sampling from sliding windows (Q414877) (← links)
- Streaming techniques and data aggregation in networks of tiny artefacts (Q465668) (← links)
- The query complexity of estimating weighted averages (Q766183) (← links)
- Adversary lower bounds for nonadaptive quantum algorithms (Q980943) (← links)
- Sample complexity of the distinct elements problem (Q1737973) (← links)
- Non-interactive proofs of proximity (Q1745962) (← links)
- Range partitioning within sublinear time in the external memory model (Q2039680) (← links)
- Range partitioning within sublinear time: algorithms and lower bounds (Q2220789) (← links)
- Predicting winner and estimating margin of victory in elections using sampling (Q2238579) (← links)
- Sublinear algorithms for approximating string compressibility (Q2392931) (← links)
- An Automatic Inequality Prover and Instance Optimal Identity Testing (Q2968159) (← links)
- A Sample of Samplers: A Computational Perspective on Sampling (Q3088190) (← links)
- Three theorems regarding testing graph properties (Q4417002) (← links)
- Sublinear Algorithms in the External Memory Model (Q4933373) (← links)
