Sciweavers

8 search results - page 1 / 2
» Construction of d(H)-disjunct matrix for group testing in hy...
Sort
View
JCO
2006
89views more  JCO 2006»
13 years 5 months ago
Construction of d(H)-disjunct matrix for group testing in hypergraphs
Hong Gao, Frank K. Hwang, My T. Thai, Weili Wu, Ta...
STOC
2009
ACM
156views Algorithms» more  STOC 2009»
14 years 5 months ago
Polynomial-time theory of matrix groups
We consider matrix groups, specified by a list of generators, over finite fields. The two most basic questions about such groups are membership in and the order of the group. Even...
László Babai, Robert Beals, Á...
SODA
2010
ACM
169views Algorithms» more  SODA 2010»
14 years 2 months ago
Efficiently Decodable Non-adaptive Group Testing
We consider the following "efficiently decodable" nonadaptive group testing problem. There is an unknown string x {0, 1}n with at most d ones in it. We are allowed to t...
Piotr Indyk, Hung Q. Ngo, Atri Rudra
ECCC
2006
134views more  ECCC 2006»
13 years 5 months ago
Derandomizing the AW matrix-valued Chernoff bound using pessimistic estimators and applications
Ahlswede and Winter [AW02] introduced a Chernoff bound for matrix-valued random variables, which is a non-trivial generalization of the usual Chernoff bound for real-valued random...
Avi Wigderson, David Xiao
TOC
2008
122views more  TOC 2008»
13 years 5 months ago
Derandomizing the Ahlswede-Winter matrix-valued Chernoff bound using pessimistic estimators, and applications
: Ahlswede and Winter [IEEE Trans. Inf. Th. 2002] introduced a Chernoff bound for matrix-valued random variables, which is a non-trivial generalization of the usual Chernoff bound ...
Avi Wigderson, David Xiao