Sciweavers

2312 search results - page 405 / 463
» On the Dimensionality of Face Space
Sort
View
IWANN
1999
Springer
14 years 2 months ago
Using Temporal Neighborhoods to Adapt Function Approximators in Reinforcement Learning
To avoid the curse of dimensionality, function approximators are used in reinforcement learning to learn value functions for individual states. In order to make better use of comp...
R. Matthew Kretchmar, Charles W. Anderson
SACRYPT
1998
Springer
14 years 2 months ago
The Nonhomomorphicity of Boolean Functions
Abstract. We introduce the notion of nonhomomorphicity as an alternative criterion that forecasts nonlinear characteristics of a Boolean function. Although both nonhomomorphicity a...
Xian-Mo Zhang, Yuliang Zheng
STOC
1997
ACM
122views Algorithms» more  STOC 1997»
14 years 2 months ago
Fault-Tolerant Quantum Computation With Constant Error
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
Dorit Aharonov, Michael Ben-Or
SIGGRAPH
1993
ACM
14 years 1 months ago
Radioptimization: goal based rendering
This paper presents a method for designing the illumination in an environment using optimization techniques applied to a radiosity based image synthesis system. An optimization of...
John K. Kawai, James S. Painter, Michael F. Cohen
SIGGRAPH
1993
ACM
14 years 1 months ago
Global visibility algorithms for illumination computations
The most expensive geometric operation in image synthesis is visibility determination. Classically this is solved with hidden surface removal algorithms that render only the parts...
Seth J. Teller, Pat Hanrahan