Results 221 to 230 of about 1,951,890 (275)

Runtime Monitoring of Static Fairness Properties

open access: yes
Henzinger TA   +3 more
europepmc   +1 more source
Some of the next articles are maybe not open access.

Related searches:

Guaranteed Error Bounds II

2014
In Chap. 3, we discussed the main ideas of fully reliable error control methods and the corresponding numerical algorithms with the paradigm of simple elliptic type problems. This chapter is intended to show a deep connection between a posteriori estimates of the functional type and physical relations generating the problem.
Olli Mali   +2 more
openaire   +1 more source

Error‐bounded Image Triangulation

Computer Graphics Forum, 2023
AbstractWe propose a novel image triangulation method to reduce the complexity of image triangulation under the color error‐bounded constraint and the triangle quality constraint. Meanwhile, we realize a variety of visual effects by supporting different types of triangles (e.g., linear or curved) and color approximation functions (e.g., constant ...
Zhi‐Duo Fang   +3 more
openaire   +1 more source

Sufficient Conditions for Error Bounds

SIAM Journal on Optimization, 2002
Summary: For a lower semicontinuous (l.s.c.) inequality system on a Banach space, it is shown that error bounds hold, provided every element in an abstract subdifferential of the constraint function at each point outside the solution set is norm bounded away from zero. A sufficient condition for a global error bound to exist is also given for an l.s.c.
Wu, Zili, Ye, Jane J.
openaire   +2 more sources

Error Bound for Conic Inequality

Vietnam Journal of Mathematics, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zheng, Xi Yin, Ng, Kung Fu
openaire   +1 more source

Error Bounds for Perturbing Nonexponential Queues

Mathematics of Operations Research, 2004
A general framework is provided to derive analytic error bounds for the effect of perturbations and inaccuracies of nonexponential service or arrival distributions in single- and multiserver queues. The general framework is worked out in detail for the three types of finite or infinite buffer queues: GI/G/1/N, M/G/c/N, and GI/M/c/N.
van Dijk, N.M., Miyazawa, M.
openaire   +4 more sources

Interval Arithmetic Error-Bounding Algorithms

SIAM Journal on Numerical Analysis, 1975
This paper first exposes some of the defects in the interval arithmetic algorithms of Moore and Kruckeberg. Then it identifies classes of problems on which these algorithms compute “optimum bounds”.
openaire   +2 more sources

Error-bounded compatible remeshing

ACM Transactions on Graphics, 2020
We present a novel method to construct compatible surface meshes with bounded approximation errors. Given two oriented and topologically equivalent surfaces and a sparse set of corresponding landmarks, our method contains two steps: (1) generate compatible meshes with bounded approximation errors and (2) reduce mesh complexity while ensuring that ...
Yang Yang   +4 more
openaire   +1 more source

Error Bounds for Convex Polynomials

SIAM Journal on Optimization, 2009
In this paper, the author establishes new properties of convex multivariate polynomials, using convex analysis. The author shows that for a convex polynomial \(f\) which is not constant on any affine subspace, if the lower level set of \(f\) (i.e., the set where \(f\) is nonpositive) is unbounded, then \(f\) can be represented as a sum of a convex ...
openaire   +1 more source

Home - About - Disclaimer - Privacy