Add to ORKGAbstract In this paper we present the new complex form for affine arithmetic (AA) which is a self-verifying computational approach that keeps track of first-order correlation between uncertainties in the data and intermediate and final results. In this paper we propose a higher-order extension satisfying the requirements of genericity, arbitrary-order and self-verification, comparing the resulting method with other well-known high-order extensions of AA
The behaviour of systems is determined by various parameters. Due to several reasons like e. g. manu...
Systems of affine recurrence equations (SAREs) over polyhedral domains are widely used to model comp...
Abstract. We give a simple formulation of Karr’s algorithm for computing all affine relationships in...
Affine Arithmetic (AA) is a self-verifying computational approach that keeps track of first-order corr...
Affine arithmetic is a model for self-validated numerical computation that keeps track of first-orde...
Le MatematicheVol. LXIII (2008 - Fasc. I, pp. 15–30)For a technical mistake this article appeared wi...
This article presents a refined algorithm using Modified Polynomial Differentiation (MPD) method thr...
In this paper, we present YalAA, a new library for affine arithmetic. Recently, affine arithmetic ha...
This paper considers some known abstract domains for affine-relation analysis, along with several va...
This paper describes a framework for the refinement of control and signal processing functions. The ...
We give a formalization of affine forms [1, 2] as abstract representa-tions of zonotopes. We provide...
International audienceIn many applications and in many fields, algorithms can con-siderably be speed...
We propose a method for maximising the affine correlation between images. The method is more global ...
To describe the state of the world, we need to describe the values of all physical quantities. In pr...
The class of affine Boolean functions is rich enough to express constant bits and de-pendencies betw...
The behaviour of systems is determined by various parameters. Due to several reasons like e. g. manu...
Systems of affine recurrence equations (SAREs) over polyhedral domains are widely used to model comp...
Abstract. We give a simple formulation of Karr’s algorithm for computing all affine relationships in...
Affine Arithmetic (AA) is a self-verifying computational approach that keeps track of first-order corr...
Affine arithmetic is a model for self-validated numerical computation that keeps track of first-orde...
Le MatematicheVol. LXIII (2008 - Fasc. I, pp. 15–30)For a technical mistake this article appeared wi...
This article presents a refined algorithm using Modified Polynomial Differentiation (MPD) method thr...
In this paper, we present YalAA, a new library for affine arithmetic. Recently, affine arithmetic ha...
This paper considers some known abstract domains for affine-relation analysis, along with several va...
This paper describes a framework for the refinement of control and signal processing functions. The ...
We give a formalization of affine forms [1, 2] as abstract representa-tions of zonotopes. We provide...
International audienceIn many applications and in many fields, algorithms can con-siderably be speed...
We propose a method for maximising the affine correlation between images. The method is more global ...
To describe the state of the world, we need to describe the values of all physical quantities. In pr...
The class of affine Boolean functions is rich enough to express constant bits and de-pendencies betw...
The behaviour of systems is determined by various parameters. Due to several reasons like e. g. manu...
Systems of affine recurrence equations (SAREs) over polyhedral domains are widely used to model comp...
Abstract. We give a simple formulation of Karr’s algorithm for computing all affine relationships in...