65 search results - page 11 / 13 » Mixing Time of Exponential Random Graphs |
100
click to vote
QRE
2008
14 years 11 months ago
2008
: Kriging-based exploration strategies often rely on a single Ordinary Kriging model which parametric covariance kernel is selected a priori or on the basis of an initial data set....
115
Voted
INFOCOM
2005
IEEE
15 years 5 months ago
2005
IEEE
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
UAI
2004
15 years 1 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...
131
Voted
SAC
2002
ACM
14 years 12 months ago
2002
ACM
We present a generic mobility and traffic generation framework that can be incorporated into a tool for modeling and simulating large scale ad hoc networks. Three components of thi...
101
click to vote
ICCS
2004
Springer
15 years 5 months ago
2004
Springer
Complex Network of Earthquakes Sumiyoshi Abe Institute of Physics, University of Tsukuba Ibaraki 3058571, Japan First, a brief discussion is made about a relevance of nonextensive...