Sciweavers

2638 search results - page 115 / 528
» Random Geometric Complexes
Sort
View
IPSN
2003
Springer
15 years 9 months ago
Distributed Environmental Monitoring Using Random Sensor Networks
Abstract. We present a distributed algorithm for environmental monitoring of a scalar field (such as temperature, intensity of light, atmospheric pressure, etc.) using a random se...
Slobodan N. Simic, Shankar Sastry
152
Voted
RSA
2000
112views more  RSA 2000»
15 years 4 months ago
Growth of components in random graphs
The creation and growth of components of a given complexity in a random graph process are studied. In particular, the expected number and total size of all such components is found...
Svante Janson
141
Voted
SIAMCOMP
2000
106views more  SIAMCOMP 2000»
15 years 4 months ago
Computationally Sound Proofs
This paper puts forward a new notion of a proof based on computational complexity and explores its implications for computation at large. Computationally sound proofs provide, in a...
Silvio Micali
PODC
2010
ACM
15 years 8 months ago
Adaptive randomized mutual exclusion in sub-logarithmic expected time
Mutual exclusion is a fundamental distributed coordination problem. Shared-memory mutual exclusion research focuses on local-spin algorithms and uses the remote memory references ...
Danny Hendler, Philipp Woelfel

Publication
222views
17 years 4 months ago
Quantitative Description of Spatially Homogeneous Textures by Characteristic Grey Level Co-Occurrences
Gibbs random eld model with multiple pairwise pixel interactions describes each type of spatially homogeneous image textures in terms of a pixel neighbourhood and Gibbs potentials...
Georgy Gimel'farb