Restitution des coefficients d'ondelettes des signaux filtrés
Restricted nondeterministic read-once branching programs and an exponential lower bound for integer multiplication
Branching programs are a well established computation model for Boolean functions, especially read-once branching programs have been studied intensively. In this paper the expressive power of nondeterministic read-once branching programs, more precisely the class of functions representable in polynomial size, is investigated. For that reason two restricted models of nondeterministic read-once branching programs are defined and a lower bound method is presented. Furthermore, the first exponential...
Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication
Branching programs are a well established computation model for Boolean functions, especially read-once branching programs have been studied intensively. In this paper the expressive power of nondeterministic read-once branching programs, more precisely the class of functions representable in polynomial size, is investigated. For that reason two restricted models of nondeterministic read-once branching programs are defined and a lower bound method is presented. Furthermore, the first exponential...
Restrictions and generalizations on comma-free codes.
RGB-D terrain perception and dense mapping for legged robots
This paper addresses the issues of unstructured terrain modeling for the purpose of navigation with legged robots. We present an improved elevation grid concept adopted to the specific requirements of a small legged robot with limited perceptual capabilities. We propose an extension of the elevation grid update mechanism by incorporating a formal treatment of the spatial uncertainty. Moreover, this paper presents uncertainty models for a structured light RGB-D sensor and a stereo vision camera used...
Risk aversion, prudence and mixed optimal saving models
The paper studies risk aversion and prudence of an agent in the face of a risk situation with two parameters, one described by a fuzzy number, the other described by a fuzzy variable. The first contribution of the paper is the characterization of risk aversion and prudence in mixed models by conditions on the concavity and the convexity of the agent's utility function and its partial derivatives. The second contribution is the building of mixed models of optimal saving and their connection with...
Robust estimation approach for nonlocal-means denoising based on structurally similar patches.
Robust optimality of Gaussian noise stability
We prove that under the Gaussian measure, half-spaces are uniquely the most noise stable sets. We also prove a quantitative version of uniqueness, showing that a set which is almost optimally noise stable must be close to a half-space. This extends a theorem of Borell, who proved the same result but without uniqueness, and it also answers a question of Ledoux, who asked whether it was possible to prove Borell’s theorem using a direct semigroup argument. Our quantitative uniqueness result has various...
Robust quasi-linear system identification
Sampling and Interpolating Sequences for Multiband-Limited Functions and Exponential Bases on Disconnected Sets.
Sampling of Band-Limited Vectors.
Sampling on the Sierpinski gasket.
Sampling theory for functions with fractal spectrum.
SAR image filtering in wavelet domain by subband depended shrink.
S-bases of proportional algebra.
Scalable PP-1 block cipher
A totally involutional, highly scalable PP-1 cipher is proposed, evaluated and discussed. Having very low memory requirements and using only simple and fast arithmetic operations, the cipher is aimed at platforms with limited resources, e.g., smartcards. At the core of the cipher's processing is a carefully designed S-box. The paper discusses in detail all aspects of PP-1 cipher design including S-box construction, permutation and round key scheduling. The quality of the PP-1 cipher is also evaluated...
Schur's Theorem on the Stability of Networks
A complex polynomial is called a Hurwitz polynomial if all its roots have a real part smaller than zero. This kind of polynomial plays an all-dominant role in stability checks of electrical networks.In this article we prove Schur's criterion [17] that allows to decide whether a polynomial p(x) is Hurwitz without explicitly computing its roots: Schur's recursive algorithm successively constructs polynomials pi(x) of lesser degree by division with x - c, ℜ {c} < 0, such that pi(x) is Hurwitz if...
Secret sharing schemes for ports of matroids of rank 3
A secret sharing scheme is ideal if the size of each share is equal to the size of the secret. Brickell and Davenport showed that the access structure of an ideal secret sharing scheme is determined by a matroid. Namely, the minimal authorized subsets of an ideal secret sharing scheme are in correspondence with the circuits of a matroid containing a fixed point. In this case, we say that the access structure is a matroid port. It is known that, for an access structure, being a matroid port is not...
Secret sharing schemes on sparse homogeneous access structures with rank three.
Secure communications based on discrete time chaotic systems