Sciweavers

5275 search results - page 45 / 1055
» Computing by observing
Sort
View
ICCV
2003
IEEE
16 years 3 months ago
Statistical Background Subtraction for a Mobile Observer
Statistical background modelling and subtraction has proved to be a popular and effective class of algorithms for segmenting independently moving foreground objects out from a sta...
Eric Hayman, Jan-Olof Eklundh
ICIP
2010
IEEE
14 years 12 months ago
Distributed classification of multiple observations by consensus
We consider the problem of distributed classification of multiple observations of the same object that are collected in an ad-hoc network of vision sensors. Assuming that each sen...
Effrosini Kokiopoulou, Pascal Frossard
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
15 years 5 months ago
How an optimal observer can collapse the search space
Many metaheuristics have difficulty exploring their search space comprehensively. Exploration time and efficiency are highly dependent on the size and the ruggedness of the search...
Christophe Philemotte, Hugues Bersini
ATAL
2004
Springer
15 years 7 months ago
Approximate Solutions for Partially Observable Stochastic Games with Common Payoffs
Partially observable decentralized decision making in robot teams is fundamentally different from decision making in fully observable problems. Team members cannot simply apply si...
Rosemary Emery-Montemerlo, Geoffrey J. Gordon, Jef...
GSN
2009
Springer
137views Sensor Networks» more  GSN 2009»
15 years 6 months ago
A Stimulus-Centric Algebraic Approach to Sensors and Observations
The understanding of complex environmental phenomena, such as deforestation and epidemics, requires observations at multiple scales. This scale dependency is not handled well by to...
Christoph Stasch, Krzysztof Janowicz, Arne Brö...