Zobrazeno 1 - 10
of 27
pro vyhledávání: '"Gebhard, Oliver"'
We study the group testing problem where the goal is to identify a set of k infected individuals carrying a rare disease within a population of size n, based on the outcomes of pooled tests which return positive whenever there is at least one infecte
Externí odkaz:
http://arxiv.org/abs/2206.07640
Autor:
Berenbrink, Petra, Coja-Oghlan, Amin, Gebhard, Oliver, Hahn-Klimroth, Max, Kaaser, Dominik, Rau, Malin
We study the Consensus problem among $n$ agents, defined as follows. Initially, each agent holds one of two possible opinions. The goal is to reach a consensus configuration in which every agent shares the same opinion. To this end, agents randomly s
Externí odkaz:
http://arxiv.org/abs/2205.08203
Autor:
Gebhard, Oliver, Loick, Philipp
The group testing problem is concerned with identifying a small set of $k$ infected individuals in a large population of $n$ people. At our disposal is a testing scheme that can test groups of individuals. A test comes back positive if and only if at
Externí odkaz:
http://arxiv.org/abs/2103.13039
Publikováno v:
IEEE Transactions on Information Theory, vol 68/4, 2022, pages 2604-2621
The group testing problem is concerned with identifying a small set of infected individuals in a large population. At our disposal is a testing procedure that allows us to test several individuals together. In an idealized setting, a test is positive
Externí odkaz:
http://arxiv.org/abs/2007.01376
Autor:
Gebhard, Oliver, Hahn-Klimroth, Max, Parczyk, Olaf, Penschuck, Manuel, Rolvien, Maurice, Scarlett, Jonathan, Tan, Nelvin
Recent advances in noiseless non-adaptive group testing have led to a precise asymptotic characterization of the number of tests required for high-probability recovery in the sublinear regime $k = n^{\theta}$ (with $\theta \in (0,1)$), with $n$ indiv
Externí odkaz:
http://arxiv.org/abs/2004.11860
Publikováno v:
In Journal of Parallel and Distributed Computing October 2023 180
In the group testing problem the aim is to identify a small set of $k\sim n^\theta$ infected individuals out of a population size $n$, $0<\theta<1$. We avail ourselves of a test procedure capable of testing groups of individuals, with the test return
Externí odkaz:
http://arxiv.org/abs/1911.02287
In the pooled data problem the goal is to efficiently reconstruct a binary signal from additive measurements. Given a signal $\sigma \in \{ 0,1 \}^n$, we can query multiple entries at once and get the total number of non-zero entries in the query as
Externí odkaz:
http://arxiv.org/abs/1905.01458
In the group testing problem we aim to identify a small number of infected individuals within a large population. We avail ourselves to a procedure that can test a group of multiple individuals, with the test result coming out positive iff at least o
Externí odkaz:
http://arxiv.org/abs/1902.02202
Autor:
Berenbrink, Petra, Coja-Oghlan, Amin, Gebhard, Oliver, Hahn-Klimroth, Max, Kaaser, Dominik, Rau, Malin
Publikováno v:
Leibniz International Proceedings in Informatics, LIPIcs 253: 23 (2023-02-01)
We study the consensus problem among n agents, defined as follows. Initially, each agent holds one of two possible opinions. The goal is to reach a consensus configuration in which every agent shares the same opinion. To this end, agents randomly sam
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d4ca354e95d97f6eb6f07f7d23f2496c