Sciweavers

11063 search results - page 335 / 2213
» On the existence of universal models
Sort
View
CAGD
2006
97views more  CAGD 2006»
15 years 6 months ago
Conditions for use of a non-selfintersection conjecture
Abstract. Volino and Thalmann have published a conjecture proposing sufficient conditions for non-selfintersection of surfaces. Such conditions may be used in solid modeling, compu...
Lars-Erik Andersson, Neil F. Stewart, Malika Zidan...
173
Voted
IANDC
2006
83views more  IANDC 2006»
15 years 6 months ago
Implicit complexity over an arbitrary structure: Quantifier alternations
We provide machine-independent characterizations of some complexity classes, over an arbitrary structure, in the model of computation proposed by L. Blum, M. Shub and S. Smale. We...
Olivier Bournez, Felipe Cucker, Paulin Jacob&eacut...
CORR
2007
Springer
169views Education» more  CORR 2007»
15 years 6 months ago
Algorithmic Complexity Bounds on Future Prediction Errors
We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true d...
Alexey V. Chernov, Marcus Hutter, Jürgen Schm...
CORR
2007
Springer
141views Education» more  CORR 2007»
15 years 6 months ago
Managing Uncertainty: A Case for Probabilistic Grid Scheduling
The Grid technology is evolving into a global, service-orientated architecture – a universal platform for delivering future high demand computational services. Strong adoption of...
Aleksandar Lazarevic, Lionel Sacks, Ognjen Prnjat
151
Voted
JFR
2008
87views more  JFR 2008»
15 years 6 months ago
Hough based terrain classification for realtime detection of drivable ground
The usability of mobile robots for surveillance, search and rescue missions can be significantly improved by intelligent functionalities decreasing the cognitive load on the opera...
Jann Poppinga, Andreas Birk 0002, Kaustubh Pathak