Sciweavers

260 search results - page 43 / 52
» Dynamic Random Geometric Graphs
Sort
View
SIGGRAPH
1997
ACM
15 years 1 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
IPSN
2011
Springer
14 years 1 months ago
Exploration of path space using sensor network geometry
In a sensor network there are many paths between a source and a destination. An efficient method to explore and navigate in the ‘path space’ can help many important routing p...
Ruirui Jiang, Xiaomeng Ban, Mayank Goswami, Wei Ze...
SIGMETRICS
2006
ACM
15 years 3 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
COMPLEX
2009
Springer
15 years 4 months ago
Synchronization Stability of Coupled Near-Identical Oscillator Network
We derive variational equations to analyze the stability of synchronization for coupled near-identical oscillators. To study the effect of parameter mismatch on the stability in a ...
Jie Sun, Erik M. Bollt, Takashi Nishikawa
ICRA
2010
IEEE
259views Robotics» more  ICRA 2010»
14 years 7 months ago
RANSAC matching: Simultaneous registration and segmentation
The iterative closest points (ICP) algorithm is widely used for ego-motion estimation in robotics, but subject to bias in the presence of outliers. We propose a random sample conse...
Shao-Wen Yang, Chieh-Chih Wang, Chun-Hua Chang