Optimal Dynamic Subset Sampling: Theory and Applications

We study the fundamental problem of sampling independent events, called subset sampling. Specifically, consider a set of \(n\) events \(S=\{x_1, \ldots, x_n\}\), where each event \(x_i\) has an associated probability \(p(x_i)\). The subset sampling problem aims to sample a subset \(T \subseteq S\),...

Celý popis

Podrobná bibliografia

Vydané v:	arXiv.org
Hlavní autori:	Lu, Yi, Wang, Hanzhi, Wei, Zhewei
Médium:	Paper
Jazyk:	English
Vydavateľské údaje:	Ithaca Cornell University Library, arXiv.org 21.09.2023
Predmet:	Algorithms Data structures Evolution Lower bounds Maximization Optimization Sampling Social networks
ISSN:	2331-8422
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!