Faster methods for random sampling
Communications of the ACM
Random sampling with a reservoir
ACM Transactions on Mathematical Software (TOMS)
An efficient parallel algorithm for random sampling
Information Processing Letters
e-approximations with minimum packing constraint violation (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Random sampling in cut, flow, and network design problems
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Reservoir-sampling algorithms of time complexity O(n(1 + log(N/n)))
ACM Transactions on Mathematical Software (TOMS)
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Random sampling in residual graphs
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Models and issues in data stream systems
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Data streams: algorithms and applications
Foundations and Trends® in Theoretical Computer Science
Fast Generation of Scale Free Networks with Directed Arcs
EPEW '09 Proceedings of the 6th European Performance Engineering Workshop on Computer Performance Engineering
Efficient Stream Sampling for Variance-Optimal Estimation of Subset Sums
SIAM Journal on Computing
Continuous sampling from distributed streams
Journal of the ACM (JACM)
Solving non-zero sum multiagent network flow security games with attack costs
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Robust tracking with weighted online structured learning
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part III
Direct out-of-memory distributed parallel frequent pattern mining
Proceedings of the 2nd International Workshop on Big Data, Streams and Heterogeneous Source Mining: Algorithms, Systems, Programming Models and Applications
A survey on concept drift adaptation
ACM Computing Surveys (CSUR)
Hi-index | 0.89 |
In this work, a new algorithm for drawing a weighted random sample of size m from a population of n weighted items, where m=