Sciweavers

3341 search results - page 138 / 669
» On Bounded Queries and Approximation
Sort
View
JAT
2010
120views more  JAT 2010»
14 years 8 months ago
Error bounds for anisotropic RBF interpolation
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...
Richard K. Beatson, Oleg Davydov, Jeremy Levesley
TCS
2010
14 years 8 months ago
CSP duality and trees of bounded pathwidth
We study non-uniform constraint satisfaction problems definable in monadic Datalog stratified by the use of non-linearity. We show how such problems can be described in terms of...
Catarina Carvalho, Víctor Dalmau, Andrei A....
IPL
2010
109views more  IPL 2010»
14 years 4 months ago
A new parameter for a broadcast algorithm with locally bounded Byzantine faults
This paper deals with broadcasting in a network with t-locally bounded Byzantine faults. One of the simplest broadcasting algorithms under Byzantine failures is referred to as a c...
Akira Ichimura, Maiko Shigeno
MOC
2002
83views more  MOC 2002»
14 years 9 months ago
A posteriori error estimates for general numerical methods for Hamilton-Jacobi equations. Part I: The steady state case
A new upper bound is provided for the L-norm of the difference between the viscosity solution of a model steady state Hamilton-Jacobi equation, u, and any given approximation, v. T...
Samuel Albert, Bernardo Cockburn, Donald A. French...
TODS
2002
92views more  TODS 2002»
14 years 9 months ago
Searching in metric spaces with user-defined and approximate distances
Metric access methods (MAMs), such as the M-tree, are powerful index structures for supporting ty queries on metric spaces, which represent a common abstraction for those searchin...
Paolo Ciaccia, Marco Patella