Sciweavers

CORR
2011
Springer
155views Education» more  CORR 2011»
13 years 6 months ago
Subexponential convergence for information aggregation on regular trees
— We consider the decentralized binary hypothesis testing problem on trees of bounded degree and increasing depth. For a regular tree of depth t and branching factor k ≥ 2, we ...
Yashodhan Kanoria, Andrea Montanari