On the Coin Weighing Problem with the Presence of Noise-Reference-Cited by-同舟云学术

On the Coin Weighing Problem with the Presence of Noise

Published:2012 Issue: Volume: Page:471-482
ISSN:0302-9743
Container-title:Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
language:
Short-container-title:

Author:

Bshouty Nader H.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-32512-0_40.pdf

Reference36 articles.

1. Aigner, M.: Combinatorial Search. John Wiley and Sons (1988)

2. Alon, N., Asodi, V.: Learning a Hidden Subgraph. SIAM J. Discrete Math. 18(4), 697–712 (2005)

3. Biglieri, E., Györfi, L.: Multiple Access Channels Theory and Practice Volume 10 NATO Security through Science Series - D: Information and Communication Security (April 2007)

4. Bruneau, L., Germinet, F.: On the singularity of random matrices with independent entries. Proc. Amer. Math. Soc. 137, 787–792 (2009)

5. Bshouty, N.H.: Optimal Algorithms for the Coin Weighing Problem with a Spring Scale. In: Conference on Learning Theory (2009)

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Signature Codes for a Noisy Adder Multiple Access Channel;2022 IEEE Information Theory Workshop (ITW);2022-11-01

2. Combinatorial Quantitative Group Testing with Adversarially Perturbed Measurements;2020 IEEE Information Theory Workshop (ITW);2021-04-11

3. Exact learning from an honest teacher that answers membership queries;Theoretical Computer Science;2018-07

4. On the dimension of additive sets;Acta Arithmetica;2015

5. Exact Learning from Membership Queries: Some Techniques, Results and New Directions;Lecture Notes in Computer Science;2013