Result 1 to 20 of 21 total
Noise-resilient group testing: limitations and constructions. (English)
Discrete Appl. Math. 161, No. 1-2, 81-95 (2013).
1
Submodular functions are noise stable. (English)
Comput. Res. Repos. 2011, Article No. 1106.0518 (2011).
2
Submodular functions are noise stable. (English)
Electron. Colloq. Comput. Complex. 18, 90 (2011).
3
Group testing with probabilistic tests: theory, design and application (English)
IEEE Transactions on Information Theory 57, No. 10, 7057-7067 (2011).
4
Approximating linear threshold predicates. (English)
Serna, Maria (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 13th international workshop, APPROX 2010, and 14th international workshop, RANDOM 2010, Barcelona, Spain, September 1‒3, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15368-6/pbk). Lecture Notes in Computer Science 6302, 110-123 (2010).
5
Improved constructions for non-adaptive threshold group testing. (English)
Abramsky, Samson (ed.) et al., Automata, languages and programming. 37th international colloquium, ICALP 2010, Bordeaux, France, July 6‒10, 2010. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-14164-5/pbk). Lecture Notes in Computer Science 6198, 552-564 (2010).
6
Improved constructions for non-adaptive threshold group testing. (English)
Comput. Res. Repos. 2010, Article No. 1002.2244 (2010).
7
Graph-constrained group testing. (English)
Comput. Res. Repos. 2010, Article No. 1001.1445 (2010).
8
Improved constructions for non-adaptive threshold group testing (English)
ICALP (1), 552-564 (2010).
9
Approximating linear threshold predicates (English)
APPROX-RANDOM, 110-123 (2010).
10
Almost-uniform sampling of points on high-dimensional algebraic varieties. (English)
Albers, Susanne (ed.) et al., STACS 2009. 26th international symposium on theoretical aspects of computer science, Freiburg, Germany, February 26‒28, 2009. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-09-5). LIPICS ‒ Leibniz International Proceedings in Informatics 3, 277-288, electronic only (2009).
11
Compressed sensing with probabilistic measurements: A group testing solution. (English)
Comput. Res. Repos. 2009, Article No. 0909.3508 (2009).
12
Almost-uniform sampling of points on high-dimensional algebraic varieties. (English)
Comput. Res. Repos. 2009, Article No. 0902.1254 (2009).
13
Noise-resilient group testing: limitations and constructions. (English)
Kutyłowski, Mirosław (ed.) et al., Fundamentals of computation theory. 17th international symposium, FCT 2009, Wrocław, Poland, September 2‒4, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03408-4/pbk). Lecture Notes in Computer Science 5699, 62-73 (2009).
14
Bit precision analysis for compressed sensing. (English)
Comput. Res. Repos. 2009, Article No. 0901.2147 (2009).
15
Invertible extractors and wiretap protocols. (English)
Comput. Res. Repos. 2009, Article No. 0901.2120 (2009).
16
Capacity achieving codes from randomness conductors. (English)
Comput. Res. Repos. 2009, Article No. 0901.1866 (2009).
17
Almost-uniform sampling of points on high-dimensional algebraic varieties (English)
STACS, 277-288 (2009).
18
Noise-resilient group testing: limitations and constructions (English)
FCT, 62-73 (2009).
19
Noise-resilient group testing: Limitations and constructions. (English)
Comput. Res. Repos. 2008, Article No. 0811.2609 (2008).
20
Result 1 to 20 of 21 total
Start
Contact
Print
General Help
