Sciweavers

1391 search results - page 80 / 279
» Complexity Limitations on Quantum Computation
Sort
View
FSTTCS
2008
Springer
13 years 9 months ago
Graph Games on Ordinals
We consider an extension of Church’s synthesis problem to ordinals by adding limit transitions to graph games. We consider game arenas where these limit transitions are defined...
Julien Cristau, Florian Horn
ICRA
2010
IEEE
111views Robotics» more  ICRA 2010»
13 years 6 months ago
Improved Monte Carlo localization of autonomous robots through simultaneous estimation of motion model parameters
Abstract— In recent years, there has been an increasing interest in autonomous navigation for lightweight flying robots. With regard to self-localization flying robots have sev...
Jörg Müller 0004, Christoph Gonsior, Wol...
NIPS
2007
13 years 9 months ago
The Tradeoffs of Large Scale Learning
This contribution develops a theoretical framework that takes into account the effect of approximate optimization on learning algorithms. The analysis shows distinct tradeoffs for...
Léon Bottou, Olivier Bousquet
CLEF
2007
Springer
14 years 2 months ago
Speeding Up IDM without Degradation of Retrieval Quality
The Image Distortion Model (IDM) has shown good retrieval quality in previous runs of the medical automatic annotation task of previous ImageCLEF workshops. However, one of its li...
Michael Springmann, Heiko Schuldt
RT
1997
Springer
13 years 12 months ago
Global Illumination Techniques for the Simulation of Participating Media
Abstract: This paper surveys global illumination algorithms for environments including participating media and accounting for multiple scattering. The objective of this survey is t...
Frederic Pérez, Xavier Pueyo, Franço...