6110 search results - page 86 / 1222 » Approximate Computing |
133
click to vote
JC
2000
15 years 6 months ago
2000
We study the complexity of approximating the Stieltjes integral R 1 0 f(x)dg(x) for functions f having r continuous derivatives and functions g whose sth derivative has bounded va...
139
click to vote
JAT
2006
15 years 6 months ago
2006
Recurrent bivariate fractal interpolation surfaces (RBFISs) generalise the notion of affine fractal interpolation surfaces (FISs) in that the iterated system of transformations us...
151
click to vote
WADS
2007
Springer
16 years 9 days ago
2007
Springer
Distance oracles and graph spanners are excerpts of a graph that allow to compute approximate shortest paths. Here, we consider the situation where it is possible to access the ori...
149
click to vote
AAAI
2006
15 years 7 months ago
2006
We show in this paper that the influential algorithm of iterative belief propagation can be understood in terms of exact inference on a polytree, which results from deleting enoug...
185
click to vote
DCOSS
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. We consider the problem of estimating the locations of mobile agents by fusing the measurements of displacements of the agents as well as relative position measurements b...