-
Computing the polyadic decomposition of nonnegative third order tensors
International audience -
Applications of theta functions for hyperelliptic curve cryptography.
Since the mid 1980's, abelian varieties have been widely used in cryptography: the discrete logarithm problem and the protocols that rely on it allow asymmetric... -
Reduced order multiobjective control
Co-encadrement de la thèse : Marc Bordier et Jean-Paul Marmorat -
Return Probabilities for the Reflected Random Walk on $\mathbb N_0$
Let $(Y_n)$ be a sequence of i.i.d. $\mathbb Z$-valued random variables with law $\mu$. The reflected random walk $(X_n)$ is defined recursively by $X_0=x \in \mathbb... -
Factorization of Unfoldings for Distributed Tile Systems Part 2: General Case
We consider large distributed discrete event systems, systems obtained by connecting a possibly large number of elementary components. By «large» we mean that the size... -
Using Geometric Constraints Through Parallelepipeds for Calibration and 3D Mo...
This paper concerns incorporation of geometric information in the camera calibration and 3D modeling. Using the geometric constraints enables stabler results and... -
Factorization of Unfoldings for Distributed Tile Systems Part 1 : Reduced Int...
We consider products of transition systems, that we representas tile systems. Tile systems can be viewed as Petri nets¸: places are replaced by (state) variables, and... -
A Direct Study in a Hilbert-Schmidt Framework of the Riccati Equation Appeari...
In this report we come back to the method of factorization of a second order elliptic boundary value problem presented in . In this paper, it was shown that, in the... -
Java Bytecode Compression for Embedded Systems
A program executing on an embedded system or similar environment faces limited memory resources and fixed time constrains. We demonstrate how factorization of common... -
An algorithm for solving dimension 5 quadratic equations without factorisation
This thesis in algorithmic number theory presents a new probabilistic algorithm for solving dimension 5 quadratic equations over Z or Q without using any... -
Hardness of Conjugacy, Embedding and Factorization of multidimensional Subshi...
International audience -
Trellis Processes : a Compact Representation for Runs of Concurrent Systems
In the true concurrency semantics, runs of a concurrent system are represented as partial orders of events. To represent sets of such runs in a compact manner,... -
A generalized Taylor factorization for Hermite subdivision schemes
International audience -
Representations of polynomials, algorithms and lower bounds
Computational complexity is the study of the resources — time, memory, …— needed to algorithmically solve a problem. Within these settings, algebraic complexity theory... -
Viewing functions as token sequences to highlight similarities in source code
International audience -
Two-generator numerical semigroups and Fermat and Marsenne numbers
International audience -
The filtering step of discrete logarithm and integer factorization algorithms
The security of most current public-key cryptosystems is based on the difficulty of finding discrete logarithms in large finite fields or factoring large integers.... -
On a system of equations with primes
This is the definitive version to appear in Journal de Théorie des Nombres de Bordeaux: 12 pages, no figures; simplified some notation; fixed typos (especially, in the proof of... -
Introduction to δ-artithmetic : computation of integer approximate gcd and fa...
In this article we present a new framework to define and compute integer approximate gcd computation. It is an extension of the classical arithmetic to solve problem...
