20 citations · 52 across the 9 of their papers we have counts for
10 papers
On a Near-Optimal \& Efficient Algorithm for the Sparse Pooled Data Problem
Max Hahn-Klimroth, Remco van der Hofstad, Noela Müller +1
The pooled data problem asks to identify the unknown labels of a set of items from condensed measurements. More precisely, given items, assume that each item has a label in $\c…
Statistical and Computational Phase Transitions in Group Testing
Amin Coja-Oghlan, Oliver Gebhard, Max Hahn-Klimroth +2
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 poo…
Multi-Band Wi-Fi Sensing with Matched Feature Granularity
Jianyuan Yu, Pu, Wang +4
Complementary to the fine-grained channel state information (CSI) from the physical layer and coarse-grained received signal strength indicator (RSSI) measurements, the mid-grained…
Near optimal efficient decoding from pooled data
Max Hahn-Klimroth, Noela Müller
Consider items, each of which is characterised by one of possible features in . We study the inference task of learning these types by queries on subset…
Efficient and accurate group testing via Belief Propagation: an empirical study
AminCoja-Oghlan, Max Hahn-Klimroth, Philipp Loick +1
The group testing problem asks for efficient pooling schemes and algorithms that allow to screen moderately large numbers of samples for rare infections. The goal is to accurately…
Inference and mutual information on random factor graphs
Amin Coja-Oghlan, Max Hahn-Klimroth, Philipp Loick +3
Random factor graphs provide a powerful framework for the study of inference problems such as decoding problems or the stochastic block model. Information-theoretically the key qua…
The random 2-SAT partition function
Dimitris Achlioptas, Amin Coja-Oghlan, Max Hahn-Klimroth +4
We show that throughout the satisfiable phase the normalised number of satisfying assignments of a random -SAT formula converges in probability to an expression predicted by the…
Optimal adaptive group testing
Max Hahn-Klimroth, Philipp Loick
The group testing problem is concerned with identifying a small number for of infected individuals in a large population of size . At our disposal is a…
Optimal group testing
Amin Coja-Oghlan, Oliver Gebhard, Max Hahn-Klimroth +1
In the group testing problem the aim is to identify a small set of infected individuals out of a population size , . We avail ourselves of a test procedure ca…
The cut metric for probability distributions
Amin Coja-Oghlan, Max Hahn-Klimroth
Guided by the theory of graph limits, we investigate a variant of the cut metric for limit objects of sequences of discrete probability distributions. Apart from establishing basic…