Errata : «Les hiérarchies de parties et leur demi-treillis»
Erratum: Equivalence of compositional expressions and independence relations in compositional models
Error frequency - regulator of the teaching algorithm
Establishing Order in Planar Subdivisions.
Estimates for H2 functions with concentration at low degrees and applications to complex symbolic computation.
Estimating composite functions by model selection
We consider the problem of estimating a function on for large values of by looking for some best approximation of by composite functions of the form . Our solution is based on model selection and leads to a very general approach to solve this problem with respect to many different types of functions and statistical frameworks. In particular, we handle the problems of approximating by additive functions, single and multiple index models, artificial neural networks, mixtures of Gaussian...
Estimating the value of contracts. A simulation study
Estimation of the algorithmic complexity of classes of computable models.
Estimation of tolerance relation on the basis of multiple pairwise comparisons with random errors
Estudio de algunas secuencias pseudoaleatorias de aplicación criptográfica.
Pseudorandom binary sequences are required in stream ciphers and other applications of modern communication systems. In the first case it is essential that the sequences be unpredictable. The linear complexity of a sequence is the amount of it required to define the remainder. This work addresses the problem of the analysis and computation of the linear complexity of certain pseudorandom binary sequences. Finally we conclude some characteristics of the nonlinear function that produces the sequences...
Étude de la séparation et de l'élimination sur une famille de graphes quotients déduite d'une méthode de dissections emboîtées
Étude des spécifications modulaires : constructions de colimites finies, diagrammes, isomorphismes
Étude des spécifications modulaires : constructions de colimites finies, diagrammes, isomorphismes. Partie II
Étude des spécifications modulaires : constructions de colimites finies, diagrammes, isomorphismes. Partie III
Étude et implémentation d'un système de déduction pour logique algorithmique
Étude spectrale de la multiplication -adique
Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.
EuDML—Towards the European Digital Mathematics Library
The paper describes the background, the expected functionalities, and the architecture design goals of the European Digital Mathematics Library (Eu-DML), an infrastructure system aimed to integrate the mathematical contents available online throughout Europe, allowing for both extensive and specialized mathematics resource discovery. The three years long project to build the EuDML, partially funded by the European Commission, started in February 2010.
Euler's Polyhedron Formula
Euler's polyhedron theorem states for a polyhedron p, thatV - E + F = 2,where V, E, and F are, respectively, the number of vertices, edges, and faces of p. The formula was first stated in print by Euler in 1758 [11]. The proof given here is based on Poincaré's linear algebraic proof, stated in [17] (with a corrected proof in [18]), as adapted by Imre Lakatos in the latter's Proofs and Refutations [15].As is well known, Euler's formula is not true for all polyhedra. The condition on polyhedra considered...
E-unification by means of tree tuple synchronized grammars.