Sciweavers

27 search results - page 2 / 6
» Solving maximum-entropy sampling problems using factored mas...
Sort
View
ATAL
2009
Springer
14 years 26 days ago
Generalized model learning for reinforcement learning in factored domains
Improving the sample efficiency of reinforcement learning algorithms to scale up to larger and more realistic domains is a current research challenge in machine learning. Model-ba...
Todd Hester, Peter Stone
APPROX
2005
Springer
111views Algorithms» more  APPROX 2005»
13 years 11 months ago
Sampling Bounds for Stochastic Optimization
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
Moses Charikar, Chandra Chekuri, Martin Pál
WSCG
2004
111views more  WSCG 2004»
13 years 7 months ago
Natural Lighting of Vegetation based on Polar Planes
We present a lighting method for outdoor scenes with vegetation. The method is compatible with multiresolution trees generated using random L-systems. We include a sky dome model ...
Maria J. Vicent, Javier Lluch, Roberto Vivó
WSCG
2004
142views more  WSCG 2004»
13 years 7 months ago
Metropolis Iteration for Global Illumination
This paper presents a stochastic iteration algorithm solving the global illumination problem, where the random sampling is governed by classical importance sampling and also by th...
László Szirmay-Kalos, Bálazs ...
ICPR
2006
IEEE
14 years 7 months ago
Face Recognition Robust to Head Pose from One Sample Image
Most face recognition systems only work well under quite constrained environments. In particular, the illumination conditions, facial expressions and head pose must be tightly con...
Brian C. Lovell, Shaokang Chen, Ting Shan