Sciweavers

2638 search results - page 4 / 528
» Random Geometric Complexes
Sort
View
ALGOSENSORS
2007
Springer
14 years 1 months ago
Maximal Breach in Wireless Sensor Networks: Geometric Characterization and Algorithms
e for abstract modeling, algorithmic design and analysis to achieve provably efficient, scalable and fault-tolerant realizations of such huge, highly-dynamic, complex, non-conventi...
Anirvan DuttaGupta, Arijit Bishnu, Indranil Sengup...
ADHOCNOW
2008
Springer
13 years 8 months ago
Communication in Random Geometric Radio Networks with Positively Correlated Random Faults
Abstract. We study the feasibility and time of communication in random geometric radio networks, where nodes fail randomly with positive correlation. We consider a set of radio sta...
Evangelos Kranakis, Michel Paquette, Andrzej Pelc
WSCG
2004
142views more  WSCG 2004»
13 years 8 months ago
Metropolis Iteration for Global Illumination
This paper presents a stochastic iteration algorithm solving the global illumination problem, where the random sampling is governed by classical importance sampling and also by th...
László Szirmay-Kalos, Bálazs ...
JMIV
2006
185views more  JMIV 2006»
13 years 7 months ago
Intrinsic Statistics on Riemannian Manifolds: Basic Tools for Geometric Measurements
In medical image analysis and high level computer vision, there is an intensive use of geometric features like orientations, lines, and geometric transformations ranging from simp...
Xavier Pennec