Faster methods for random sampling
From MaRDI portal
Recommendations
Cited in
(21)- scientific article; zbMATH DE number 1857637 (Why is no real title available?)
- Computer generated simple random samples
- scientific article; zbMATH DE number 2101371 (Why is no real title available?)
- Markov chain Monte Carlo sampling using a reservoir method
- Efficient sampling methods for discrete distributions
- Weighted random sampling with a reservoir
- An improved deterministic algorithm for generating different many-element random samples
- Sequential random sampling
- Sampling without compromising accuracy in adaptive data analysis
- An efficient parallel algorithm for random sampling
- scientific article; zbMATH DE number 4163904 (Why is no real title available?)
- A stochastic simulation algorithm for accelerating RRA
- Practical algorithms for generating a random ordering of the elements of a weighted set
- FastSIR algorithm: a fast algorithm for the simulation of the epidemic spread in large networks by using the susceptible-infected-recovered compartment model
- Boosting distinct random sampling for basic counting on the union of distributed streams
- Shortest paths in Euclidean graphs
- Sampling method by allocating random order to percentiles
- Heterogeneous subset sampling
- Efficient parallel random sampling-vectorized, cache-efficient, and online
- An efficient algorithm for random sampling without replacement
- A stratified reservoir sampling algorithm in streams and large datasets
This page was built for publication: Faster methods for random sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3727227)