107 search results - page 2 / 22 » Uniqueness of simultaneous approximations in continuous func... |
129
click to vote
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
In this paper, we address the matrix completion problem and propose a novel algorithm based on a smoothed rank function (SRF) approximation. Among available algorithms like FPCA a...
134
Voted
ICCBR
2005
Springer
15 years 9 months ago
2005
Springer
CBR is one of the techniques that can be applied to the task of approximating a function over high-dimensional, continuous spaces. In Reinforcement Learning systems a learning agen...
133
Voted
NN
2000
Springer
15 years 3 months ago
2000
Springer
In Lp-spaces with p [1, ) there exists a best approximation mapping to the set of functions computable by Heaviside perceptron networks with n hidden units; however for p (1, ) ...
240
click to vote
SIGMOD
2005
ACM
16 years 3 months ago
2005
ACM
While traditional database systems optimize for performance on one-shot queries, emerging large-scale monitoring applications require continuous tracking of complex aggregates and...
136
Voted
AIPS
2004
15 years 4 months ago
2004
Approximate linear programming (ALP) offers a promising framework for solving large factored Markov decision processes (MDPs) with both discrete and continuous states. Successful ...