Sciweavers

3670 search results - page 542 / 734
» Linear Recursive Functions
Sort
View
ICML
2000
IEEE
16 years 7 months ago
Rates of Convergence for Variable Resolution Schemes in Optimal Control
This paper presents a general method to derive tight rates of convergence for numerical approximations in optimal control when we consider variable resolution grids. We study the ...
Andrew W. Moore, Rémi Munos
211
Voted
VISUALIZATION
2005
IEEE
15 years 12 months ago
Evolutionary Morphing
We introduce a technique to visualize the gradual evolutionary change of the shapes of living things as a morph between known three-dimensional shapes. Given geometric computer mo...
David F. Wiley, Nina Amenta, Dan A. Alcantara, Deb...
AMAI
2004
Springer
15 years 11 months ago
Approximate Probabilistic Constraints and Risk-Sensitive Optimization Criteria in Markov Decision Processes
The majority of the work in the area of Markov decision processes has focused on expected values of rewards in the objective function and expected costs in the constraints. Althou...
Dmitri A. Dolgov, Edmund H. Durfee
STOC
2000
ACM
174views Algorithms» more  STOC 2000»
15 years 10 months ago
Noise-tolerant learning, the parity problem, and the statistical query model
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
Avrim Blum, Adam Kalai, Hal Wasserman
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
15 years 10 months ago
Bounds for the computational power and learning complexity of analog neural nets
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
Wolfgang Maass