Improved Bounds and Algorithms for Sparsity Constrained Group Testing

Nelvin Tan
Nelvin Tan

arXiv preprint arXiv:2004.03119, 2020.

Cited by: 0|Views4

Abstract:

In group testing, the goal is to identify a subset of defective items within a larger set of items based on tests whose outcomes indicate whether any defective item is present. This problem is relevant in areas such as medical testing, data science, communications, and many more. Motivated by physical considerations, we consider a sparsit...More

Code:

Data:

Get fulltext within 24h
Bibtex
Upload PDF

1.Your uploaded documents will be check within 24h, and coins will be credited to your account.

2.As the current system does not support cash withdrawal, you can add staff WeChat (AMxiaomai) to receive it as a red packet.

3.10 coins will be exchanged for 1 yuan.

?

Upload a single paper

for 5 coins

Wechat's Red Packet
?

Upload 50 articles

for 250 coins

Wechat's Red Packet
?

Upload 200 articles

for 1000 coins

Wechat's Red Packet
?

Upload 500 articles

for 2500 coins

Wechat's Red Packet
?

Upload 1000 articles

for 5000 coins

Wechat's Red Packet
Your rating :
0

 

Tags
Comments