279 search results - page 36 / 56 » Approximating Average Parameters of Graphs |
117
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
—We apply large deviations theory to study asymptotic performance of running consensus distributed detection in sensor networks. Running consensus is a stochastic approximation t...
124
Voted
WWW
2005
ACM
16 years 3 months ago
2005
ACM
PageRank is defined as the stationary state of a Markov chain obtained by perturbing the transition matrix of a web graph with a damping factor that spreads part of the rank. The...
127
click to vote
ICASSP
2008
IEEE
15 years 9 months ago
2008
IEEE
We deal with consensus-based online estimation and tracking of (non-) stationary signals using ad hoc wireless sensor networks (WSNs). A distributed (D-) least-mean square (LMS) l...
130
Voted
ICIP
2010
IEEE
15 years 17 days ago
2010
IEEE
In this paper, we propose a novel image similarity learning approach based on Probabilistic Feature Matching (PFM). We consider the matching process as the bipartite graph matchin...
115
click to vote
ICPR
2000
IEEE
16 years 3 months ago
2000
IEEE
An important theoretical tool in machine learning is the bias/variance decomposition of the generalization error. It was introduced for the mean square error in [3]. The bias/vari...