Algorithme de Brill-Noether et codes de Goppa
Algorithmes de plus courts chemins pour traiter des données floues
Aliasing and Poisson Summation in the Sampling Theory of Paley-Wiener Spaces.
All Generalized Morse-Sequences are Loosely Bernoulli.
Alon-Babai-Suzuki's conjecture related to binary codes in nonmodular version.
Alphabet-oriented and user-oriented source coding theories
An algebraic approach to fix points of GOST-algorithm
An algorithm for calculating the channel capacity of degree
An algorithm for hybrid regularizers based image restoration with Poisson noise
In this paper, a hybrid regularizers model for Poissonian image restoration is introduced. We study existence and uniqueness of minimizer for this model. To solve the resulting minimization problem, we employ the alternating minimization method with rigorous convergence guarantee. Numerical results demonstrate the efficiency and stability of the proposed method for suppressing Poisson noise.
An algorithm for model reduction in large electric power systems.
An algorithm for nonharmonic signal analysis using Dirichlet series on convex polygons.
An alternative formulation of the factorization conjecture for codes. (Une formulation alternative de la conjecture de factorisation des codes.)
An alternative method for construction of optimal sequential questionnaires
An analytical iterative statistical algorithm for image reconstruction from projections
The main purpose of the paper is to present a statistical model-based iterative approach to the problem of image reconstruction from projections. This originally formulated reconstruction algorithm is based on a maximum likelihood method with an objective adjusted to the probability distribution of measured signals obtained from an x-ray computed tomograph with parallel beam geometry. Various forms of objectives are tested. Experimental results show that an objective that is exactly tailored statistically...
An angent based approach to modeling the secure electronic transaction protocol.
An application of a functional equation to information theory
An application of algebraic geometry to encryption: tame transformation method.
An application of the expectation-maximization algorithm to interference rejection for direct-sequence spread-spectrum signals
For a direct-sequence spread-spectrum (DS-SS) system we pose and solve the problem of maximum-likelihood (ML) sequence estimation in the presence of narrowband interference, using the expectation-maximization (EM) algorithm. It is seen that the iterative EM algorithm obtains at each iteration an estimate of the interference which is then subtracted from the data before a new sequence estimate is produced. Both uncoded and trellis coded systems are studied, and the EM-based algorithm is seen to perform...
An asymptotic Gilbert-Varshamov bound for -nets.
An automatic segmentation method for scanned images of wheat root systems with dark discolourations
The analysis of plant root system images plays an important role in the diagnosis of plant health state, the detection of possible diseases and growth distortions. This paper describes an initial stage of automatic analysis-the segmentation method for scanned images of Ni-treated wheat roots from hydroponic culture. The main roots of a wheat fibrous system are placed separately in the scanner view area on a high chroma background (blue or red). The first stage of the method includes the transformation...