12 search results - page 3 / 3 » Implementing Huge Sparse Random Graphs |
CORR
2007
Springer
14 years 10 months ago
2007
Springer
This paper derives a near optimal distributed Kalman filter to estimate a large-scale random field monitored by a network of N sensors. The field is described by a sparsely con...
111
Voted
NIPS
2004
14 years 11 months ago
2004
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...