269 search results - page 7 / 54 » Asymptotic convergence of degree-raising |
CORR
2011
Springer
13 years 2 months ago
2011
Springer
— 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 ...
CSDA
2007
13 years 7 months ago
2007
Random k-nearest-neighbour (RKNN) imputation is an established algorithm for filling in missing values in data sets. Assume that data are missing in a random way, so that missing...
CDC
2008
IEEE
14 years 2 months ago
2008
IEEE
— We study the problem of dynamic learning by a social network of agents. Each agent receives a signal about an underlying state and communicates with a subset of agents (his nei...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
In a multiple-access communication network, nodes must compete for scarce communication resources such as bandwidth. This paper analyzes the asymptotic behavior of a multipleaccess...
ANOR
2006
13 years 7 months ago
2006
This note develops asymptotic formulae for single-commodity network flow problems with random inputs. The transportation linear programming problem (TLP) where N points lie in a r...