188 search results - page 9 / 38 » Estimation error bounds for denoising by sparse approximatio... |
103
click to vote
JAT
2010
14 years 8 months ago
2010
We present error bounds for the interpolation with anisotropically transformed radial basis functions for both function and its partial derivatives. The bounds rely on a growth fu...
83
Voted
SODA
2008
ACM
14 years 11 months ago
2008
ACM
The problem of maximizing a concave function f(x) in a simplex S can be solved approximately by a simple greedy algorithm. For given k, the algorithm can find a point x(k) on a k-...
64
Voted
CORR
2010
Springer
14 years 9 months ago
2010
Springer
In practical nonlinear filtering, the assessment of achievable filtering performance is important. In this paper, we focus on the problem of how to efficiently approximate the post...
125
Voted
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
77
Voted
JAT
2010
14 years 8 months ago
2010
In [6], we proved an asymptotic O(n−α/(α+1)) bound for the approximation of SU(N) loops (N ≥ 2) with Lipschitz smoothness α > 1/2 by polynomial loops of degree ≤ n. Th...