Landin’s SECD machine was the first abstract machine for the λ-calculus viewed as a programming language. Both theoretically as a model of computation and practically as an ide...
In this paper, we propose a new shape decomposition method, called convex shape decomposition. We formalize the convex decomposition problem as an integer linear programming probl...
We study how the error of an ensemble regression estimator can be decomposed into two components: one accounting for the individual errors and the other accounting for the correlat...
For the first time, a proof of the sifting process (SP) and so the empirical mode decomposition (EMD), is given. For doing this, lower and upper envelopes are modeled in a more c...
El-Hadji Samba Diop, R. Alexandre, Abdel-Ouahab Bo...
We present a new general class of methods for the computation of high-dimensional integrals. The quadrature schemes result by truncation and discretization of the anchored-ANOVA d...