6315 search results - page 181 / 1263 » Approximating Solution Structure |
211
click to vote
FOCS
2003
IEEE
15 years 11 months ago
2003
IEEE
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...
208
click to vote
UAI
2008
15 years 8 months ago
2008
We consider the problem of efficiently learning optimal control policies and value functions over large state spaces in an online setting in which estimates must be available afte...
162
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
A major enterprise in compressed sensing and sparse approximation is the design and analysis of computationally tractable algorithms for recovering sparse, exact or approximate, s...
171
click to vote
NECO
1998
15 years 6 months ago
1998
We derive solutions for the problem of missing and noisy data in nonlinear timeseries prediction from a probabilistic point of view. We discuss different approximations to the so...
187
click to vote
JMIV
2010
15 years 1 months ago
2010
This paper proposes robust algorithms to deconvolve discrete noised signals and images. The solutions are derived as linear combinations of spline wavelet packets that minimize so...