Sciweavers

3096 search results - page 314 / 620
» Theory and Use of the EM Algorithm
Sort
View
ICASSP
2009
IEEE
15 years 4 months ago
Distributed sampling and reconstruction of non-bandlimited fields in sensor networks based on shift-invariant spaces
We use the theory and algorithms developed for so-called shiftinvariant spaces to develop a novel distributed architecture for sampling and reconstructing non-bandlimited fields i...
Gunter Reise, Gerald Matz
ICCV
2011
IEEE
14 years 6 months ago
Dense Disparity Maps from Sparse Disparity Measurements
In this work we propose a method for estimating disparity maps from very few measurements. Based on the theory of Compressive Sensing, our algorithm accurately reconstructs dispar...
Simon Hawe, Martin Kleinsteuber, Klaus Diepold
IPSN
2004
Springer
16 years 1 days ago
Lattice sensor networks: capacity limits, optimal routing and robustness to failures
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
Guillermo Barrenechea, Baltasar Beferull-Lozano, M...
SAGT
2010
Springer
160views Game Theory» more  SAGT 2010»
15 years 5 months ago
How Do You Like Your Equilibrium Selection Problems? Hard, or Very Hard?
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
Paul W. Goldberg
GECCO
2004
Springer
175views Optimization» more  GECCO 2004»
16 years 1 days ago
Enhanced Innovation: A Fusion of Chance Discovery and Evolutionary Computation to Foster Creative Processes and Decision Making
Abstract. Human-based genetic algorithms are powerful tools for organizational modeling. If we enhance them using chance discovery techniques, we obtain an innovative approach for ...
Xavier Llorà, Kei Ohnishi, Ying-Ping Chen, ...