-
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,... -
Level of Detail Continuum for Huge Geometric Data
In this paper we propose a unified solution for the creation of levels of detail on very large input data. We build a hierarchical signed distance function in an... -
Fusion of Multi-View Silhouette Cues Using a Space Occupancy Grid
In this report, we investigate what can be inferred from several silhouette probability maps, in multi-camera environments. To this aim, we propose a new framework for... -
Virtual garments based on geometric features of fabric buckling
We present a new, procedural approach for modelling and animating the garments worn by virtual characters. Our method takes into account the properties of fabric to... -
Modeling and Numerical Simulation of Space Charge Dominated Beams in the Para...
This work is devoted to the modeling of space charge dominated particle beams in the paraxial approximation with several types of external focusing fields (uniform,... -
High order cross derivative computation for the differential cross section of...
The double ionization of an atom or a molecule is strongly dependent of the quality of the description of the initial state of the target. Recently, absolute... -
A Randomized Quasi-Monte Carlo Simulation Method for Markov Chains
We introduce and study a randomized quasi-Monte Carlo method for estimating the state distribution at each step of a Markov chain, under the assumption that the chain... -
Weighted Improper Colouring
In this paper, we study a colouring problem motivated by a practical frequency assignment problem and, up to our best knowledge, new. In wireless networks, a node... -
IMPLEMENTATION DES E-MARKETS SOUS DES PLATEFORMES MULTI-AGENTS
Après la présentation des trois plateformes multi-agents JADE, MADKIT et MAGIQUE et leurs principaux packages, offerts par leurs API, nous avons prévu une première... -
Algorithms Seminar, 2002-2004
These seminar notes constitute the proceedings of a seminar devoted to the analysis of algorithms and related topics. The subjects covered include combinatorics,... -
Perfect Sorting by Reversals
In computational biology, gene order data is often modelled as signed permutations. A classical problem in genome comparison is to detect conserved segments in a... -
Non-uniformity measurements of PbWO$_4$ crystals
This dataset has no description
-
Point processes in forestry : an application to tree crown detection
In this research report, we aim at extracting tree crowns from remotely sensed images using marked point processes of discs and ellipses. Our approach is indeed to... -
Learning Transition Rules from Temporal Logic Properties
Most of the work on temporal representation issues in Machine Learning deals with the problem of learning/mining temporal patterns from a large set of temporal data.... -
Routing in Extremely Mobile Networks
We consider the problem of routing in a highly mobile network which is never fully connected. We describe algorithms that allow to route a packet toward a remote... -
SSI-OSCAR: a Cluster Distribution for High Performance Computing Using a Sing...
The ease use and management of clusters needs tools to install, update and transparently manage distributed clusters resources. The management of clusters (node... -
Interactivité efficace pour les algorithmes évolutionnaires interactifs. Appl...
Les algorithmes évolutionnaires interactifs pâtissent souvent de ce que l'on peut appeler le « goulot d'étranglement de l'utilisateur », autrement dit une perte... -
Algebraic Immunities of functions over finite fields
A general mathematical definition for a function from $GF(q)^n$ to $GF(q)^m$ to resist to cryptanalytic attacks is developed. It generalize the definition of Algebraic... -
OSCAR on Debian: the EDF Experience
Linux clusters are now an interesting solution to execute numerical simulations. But cluster use implies problems of deployment, because of their distributed... -
Nearest neighbor classification in infinite dimension
Let $X$ be a random element in a metric space $(\calF,d)$, and let $Y$ be a random variable with value $0$ or $1$. $Y$ is called the class, or the label, of $X$....
