Sciweavers

412 search results - page 37 / 83
» Algorithmic Complexity Bounds on Future Prediction Errors
Sort
View
TOG
2008
139views more  TOG 2008»
14 years 11 months ago
Logarithmic perspective shadow maps
We present a novel shadow map parameterization to reduce perspective aliasing artifacts for both point and directional light sources. We derive the aliasing error equations for bo...
Brandon Lloyd, Naga K. Govindaraju, Cory Quammen, ...
NIPS
2003
15 years 1 months ago
Robustness in Markov Decision Problems with Uncertain Transition Matrices
Optimal solutions to Markov Decision Problems (MDPs) are very sensitive with respect to the state transition probabilities. In many practical problems, the estimation of those pro...
Arnab Nilim, Laurent El Ghaoui
ICRA
2010
IEEE
220views Robotics» more  ICRA 2010»
14 years 10 months ago
Autonomous Underwater Vehicle trajectory design coupled with predictive ocean models: A case study
— Data collection using Autonomous Underwater Vehicles (AUVs) is increasing in importance within the oceanographic research community. Contrary to traditional moored or static pl...
Ryan N. Smith, Arvind Pereira, Yi Chao, Peggy Li, ...
IJAR
2006
125views more  IJAR 2006»
14 years 11 months ago
Computing best-possible bounds for the distribution of a sum of several variables is NP-hard
In many real-life situations, we know the probability distribution of two random variables x1 and x2, but we have no information about the correlation between x1 and x2; what are ...
Vladik Kreinovich, Scott Ferson
ESANN
2004
15 years 1 months ago
Soft-computing techniques for time series forecasting
One way to contrast the behaviour of different algorithms in the field of timeseries forecasting is to compare the prediction error using a benchmark problem. Another interesting ...
Ignacio Rojas Ruiz, Héctor Pomares