3038 search results - page 487 / 608 » High-Speed Function Approximation |
152
click to vote
APPROX
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We study tolerant linearity testing under general distributions. Given groups G and H, a distribution µ on G, and oracle access to a function f : G → H, we consider th...
145
click to vote
ATAL
2009
Springer
15 years 11 months ago
2009
Springer
One of the key problems in reinforcement learning is balancing exploration and exploitation. Another is learning and acting in large or even continuous Markov decision processes (...
136
click to vote
MIDDLEWARE
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Pervasive computing applications often entail continuous monitoring tasks, issuing persistent queries that return continuously updated views of the operational environmen...
129
click to vote
PKDD
2009
Springer
15 years 11 months ago
2009
Springer
The Support Vector Machine error bound is a function of the margin and radius. Standard SVM algorithms maximize the margin within a given feature space, therefore the radius is fi...
131
click to vote
PKDD
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by 1 regularised least-squares (Lasso) [4,10] in a similar vein to (Or...