Sciweavers

1015 search results - page 5 / 203
» On Information Regularization
Sort
View
CORR
2011
Springer
155views Education» more  CORR 2011»
13 years 2 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
IFIP
2004
Springer
14 years 22 days ago
Regular Tree Language Recognition with Static Information
This paper presents our compilation strategy to produce efficient code for pattern matching in the CDuce compiler, taking into account static information provided by the type syst...
Alain Frisch
DIGITALCITIES
2001
Springer
13 years 12 months ago
Regularities in the Formation and Evolution of Information Cities
In the real world, cities exist because of external economies associated with the geographic concentration of firms within a city. Of course, such a geographic proximity with input...
Stelios Lelis, Petros Kavassalis, Jakka Sairamesh,...
CSL
2006
Springer
13 years 11 months ago
Algorithms for Omega-Regular Games with Imperfect Information,
We study observation-based strategies for two-player turn-based games on graphs with omega-regular objectives. An observation-based strategy relies on imperfect information about t...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...