2004 search results - page 341 / 401 » Sampling from large graphs |
CN
2010
13 years 10 months ago
2010
We consider massively dense ad hoc networks and study their continuum limits as the node density increases and as the graph providing the available routes becomes a continuous area...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
A recent study characterizing failures in computer networks shows that transient single element (node/link) failures are the dominant failures in large communication networks like...
CORR
2006
Springer
13 years 10 months ago
2006
Springer
We propose a method to improve approximate inference methods by correcting for the influence of loops in the graphical model. The method is a generalization and alternative implem...
JAIR
2006
13 years 10 months ago
2006
In a peer-to-peer inference system, each peer can reason locally but can also solicit some of its acquaintances, which are peers sharing part of its vocabulary. In this paper, we ...
JSA
2006
13 years 10 months ago
2006
Interprocedural data flow analyses of executable programs suffer from the conservative assumptions that need to be made because no precise control flow graph is available and beca...