12519 search results - page 328 / 2504 » Approximation Problems Categories |
189
click to vote
DAGSTUHL
2004
15 years 8 months ago
2004
Nonlinear approximation has usually been studied under deterministic assumptions and complete information about the underlying functions. In the present paper we assume only partia...
147
click to vote
UAI
2004
15 years 8 months ago
2004
In this paper, we propose a new lower approximation scheme for POMDP with discounted and average cost criterion. The approximating functions are determined by their values at a fi...
194
click to vote
AUTOMATICA
2008
15 years 6 months ago
2008
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
171
click to vote
JMM2
2007
15 years 6 months ago
2007
—This paper aims to develop a novel framework to systematically trade-off computational complexity with output distortion in linear multimedia transforms, in an optimal manner. T...
196
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
—In this paper, we introduce a sparse approximation property of order s for a measurement matrix A: xs 2 ≤ D Ax 2 + β σs(x) √ s for all x, where xs is the best s-sparse app...