3096 search results - page 187 / 620 » The Generalized FITC Approximation |
175
click to vote
AIPS
2006
15 years 6 months ago
2006
Markov decision processes (MDPs) with discrete and continuous state and action components can be solved efficiently by hybrid approximate linear programming (HALP). The main idea ...
145
click to vote
GECCO
2008
Springer
15 years 6 months ago
2008
Springer
We propose an algorithm for function approximation that evolves a set of hierarchical piece-wise linear regressors. The algorithm, named HIRE-Lin, follows the iterative rule learn...
115
click to vote
MOC
2000
15 years 4 months ago
2000
Let {Sm} be an infinite sequence whose limit or antilimit S can be approximated very efficiently by applying a suitable extrapolation method E0 to {Sm}. Assume that the Sm and henc...
157
click to vote
APPROX
2011
Springer
14 years 5 months ago
2011
Springer
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...
381
click to vote
ICA
2012
Springer
14 years 16 days ago
2012
Springer
A novel tensor decomposition called pattern or P-decomposition is proposed to make it possible to identify replicating structures in complex data, such as textures and patterns in ...