Results 261 to 270 of about 369,812 (312)

Approximate Order Dependency Discovery

2021 IEEE 37th International Conference on Data Engineering (ICDE), 2021
Lexicographical order dependencies (ODs) specify orders between list of attributes, and are proven useful in optimizing SQL queries with order by clauses. To find hidden ODs from dirty data in practice, in this paper we make a first effort to study the approximate OD discovery problem, aiming at automatically discovering ODs that hold on the data with ...
Yifeng Jin   +3 more
openaire   +1 more source

On the Randomized Bernstein Approximation Theorem and the Order of Approximation

Lobachevskii Journal of Mathematics, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

A note on the “order of approximation”

International Journal of Solids and Structures, 1985
In this very short note, a procedure is given for finding the nodal order of error for some finite element models, and one proves the superconvergence of one-dimensional problems of Pin Tong kind.
Taylor, R. L., Zienkiewicz, O. C.
openaire   +2 more sources

On the approximation order of tangent estimators

Computer Aided Geometric Design, 2008
A classic problem in geometric modelling is curve interpolation to data points. Some of the existing interpolation schemes only require point data, whereas others, require higher order information, such as tangents or curvature values, in the data points.
Gudrun Albrecht   +3 more
openaire   +1 more source

Home - About - Disclaimer - Privacy