Sciweavers

1434 search results - page 152 / 287
» Distributed Computing with Imperfect Randomness
Sort
View
ECCV
2008
Springer
16 years 1 months ago
Surface Visibility Probabilities in 3D Cluttered Scenes
Many methods for 3D reconstruction in computer vision rely on probability models, for example, Bayesian reasoning. Here we introduce a probability model of surface visibilities in ...
Michael S. Langer
INFOCOM
2007
IEEE
15 years 6 months ago
Polynomial Complexity Algorithms for Full Utilization of Multi-Hop Wireless Networks
— In this paper, we propose and study a general framework that allows the development of distributed mechanisms to achieve full utilization of multi-hop wireless networks. In par...
Atilla Eryilmaz, Asuman E. Ozdaglar, Eytan Modiano
CDC
2009
IEEE
124views Control Systems» more  CDC 2009»
15 years 4 months ago
The Kalman like particle filter: Optimal estimation with quantized innovations/measurements
— We study the problem of optimal estimation using quantized innovations, with application to distributed estimation over sensor networks. We show that the state probability dens...
Ravi Teja Sukhavasi, Babak Hassibi
COLT
1992
Springer
15 years 3 months ago
Language Learning from Stochastic Input
Language learning from positive data in the Gold model of inductive inference is investigated in a setting where the data can be modeled as a stochastic process. Specifically, the...
Shyam Kapur, Gianfranco Bilardi
DIALM
2008
ACM
168views Algorithms» more  DIALM 2008»
15 years 1 months ago
Local broadcasting in the physical interference model
In this work we analyze the complexity of local broadcasting in the physical interference model. We present two distributed randomized algorithms: one that assumes that each node ...
Olga Goussevskaia, Thomas Moscibroda, Roger Watten...