70 search results - page 13 / 14 » On the connectivity of dynamic random geometric graphs |
INFOCOM
2009
IEEE
14 years 26 days ago
2009
IEEE
—This paper presents Respondent-Driven Sampling (RDS) as a promising technique to derive unbiased estimates of node properties in unstructured overlay networks such as Gnutella. ...
BC
2005
13 years 6 months ago
2005
Abstract We model the dynamical behavior of the neuropil, the densely interconnected neural tissue in the cortex, using neuropercolation approach. Neuropercolation generalizes phas...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
UAI
2004
13 years 7 months ago
2004
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Prev...
CORR
2007
Springer
13 years 6 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...