Information-theoretic and algorithmic aspects of parallel and distributed reconstruction from pooled data

In the pooled data problem the goal is to efficiently reconstruct a binary signal from additive measurements. Given a signal σ∈{0,1}n, we can query multiple entries at once and get the total number of non-zero entries in the query as a result. We assume that queries are time-consuming and therefore...

Celý popis

Podrobná bibliografia

Vydané v:	Journal of parallel and distributed computing Ročník 180; s. 104718
Hlavní autori:	Gebhard, Oliver, Hahn-Klimroth, Max, Kaaser, Dominik, Loick, Philipp
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Inc 01.10.2023
Predmet:	Noisy pooled data Non-adaptive algorithm Pooled data Quantitative group testing Quantitative group testing Pooled data Non-adaptive algorithm Noisy pooled data
ISSN:	0743-7315, 1096-0848
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!