3038 search results - page 33 / 608 » High-Speed Function Approximation |
PKDD
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Feature selection in reinforcement learning (RL), i.e. choosing basis functions such that useful approximations of the unkown value function can be obtained, is one of th...
SODA
2008
ACM
14 years 11 months ago
2008
ACM
In this paper, we present two techniques to analyze greedy approximation with nonsubmodular functions restricted submodularity and shifted submodularity. As an application of the ...
JSCIC
2007
14 years 9 months ago
2007
In this paper, we extend the adjoint error correction of Pierce and Giles [SIAM Review, 42 (2000), pp. 247-264] for obtaining superconvergent approximations of functionals to Gale...
127
click to vote
JMLR
2010
14 years 4 months ago
2010
We address instance-based learning from a perceptual organization standpoint and present methods for dimensionality estimation, manifold learning and function approximation. Under...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
One way to find closest pairs in large datasets is to use hash functions [6], [12]. In recent years locality-sensitive hash functions for various metrics have been given: projecti...