Sciweavers

48 search results - page 10 / 10
» Plane and Planarity Thresholds for Random Geometric Graphs
Sort
View
SASO
2008
IEEE
14 years 5 days ago
Empirical Characterization of Discretization Error in Gradient-Based Algorithms
Many self-organizing and self-adaptive systems use the biologically inspired “gradient” primitive, in which each device in a network estimates its distance to the closest devi...
Jonathan Bachrach, Jacob Beal, Joshua Horowitz, Da...
SIGMETRICS
2006
ACM
13 years 11 months ago
Robust network connectivity: when it's the big picture that matters
This work analyzes the connectivity of large diameter networks where every link has an independent probability p of failure. We give a (relatively simple) topological condition th...
Enoch Peserico, Larry Rudolph
SIGGRAPH
1997
ACM
13 years 10 months ago
Metropolis light transport
We present a new Monte Carlo method for solving the light transport problem, inspired by the Metropolis sampling method in computational physics. To render an image, we generate a...
Eric Veach, Leonidas J. Guibas