Tree Structured Non-linear Signal Modeling and Prediction (2008)
Olivier Michel, Ecole Normale, Superieure Lyon
We develop a non-parametric method of nonlinear prediction based on adaptive partitioning of the phase space associated with the process. The partitioning method is implemented with a recursive...
for High Performance Networks (2007)
Ecole Normale, Superieure Lyon, Unite Mixte, Olivier Aumage, Olivier Aumage, ...
This report introduces a version of MPICH handling efficiently different networks simultaneously. The core of the implementation relies on a device called ch mad which is based on a generic...
The Topological Entropy of Iterated Piecewise Ane Maps is Uncomputable (2007)
Superieure Lyon, Unite Mixte, Ecole Normale, Ecole Normale, Sup Lyon, ...
We show that it is impossible to compute (or even to approximate) the topological entropy of a continuous piecewise ane function in dimension 4. The same result holds for saturated linear functions...
for Generic Curves and a Decision Algorithm for the Limit Theory (2007)
Superieure Lyon, Unite Mixte, Natacha Portier September, Ecole Normale, Ecole Normale, ...
It was recently shown that the theories of generic algebraic curves converge to a limit theory as their degrees go to innity. In this paper we give quantitative versions of this result and other...
Quantum Automata and Algebraic Groups (2007)
Ecole Normale, Superieure Lyon, Unite Mixte, Emmanuel Jeandel, Emmanuel Je, ...
We show that several problems which are known to be undecidable for probabilistic automata become decidable for quantum finite automata. Our main tool is an algebraic result of independent interest:...
A Rank Theorem for Vandermonde Matrices (2007)
Ecole Normale, Superieure Lyon, Unite Mixte, Pascal Koiran, Pascal Koiran, ...
We show that certain matrices built from Vandermonde matrices are of full rank. This result plays a key role in the construction of the \limit theory of generic polynomials".
Cedric Gegout, Fabrice Rossi, Ecole Normale, Superieure Lyon
Resume: L'utilisation des algorithmes evolutionnistes est e#cace pour l'apprentissage des reseaux de neurones booleens mais semble complexe pour l'apprentissage des reseaux de neurones...
Ecole Normale Sup erieure de (2007)
Ecole Normale, Superieure Lyon, Unite Mixte
An algebraic method to compute a shortest path of local ips between two tilings
Bounded Polymorphism for Extensible Objects (2007)
Ecole Normale, Superieure Lyon, Unite Mixte, Luigi Liquori, Luigi Liquori
In the ECOOP'97 conference, the author of the present paper investigated a conservative extension, called Ob 1, of the first-order Object Calculus Ob 1 of Abadi and Cardelli, supporting method...
Superieure Lyon, Unite Mixte, Ecole Normale, Ecole Normale, Sup Lyon, ...
On the sensitivity of additive cellular automata in Besicovitch topologies
Ecole Normale, Superieure Lyon, Unite Mixte, C. Mongenet, C. Mongenet, ...
Workshop "Compilation et Parallelisation
Amir Dembo, Ecole Normale, Superieure Lyon, Ofer Zeitouni
properties of Sinai's model of random walk in random environment
Ecole Normale, Superieure Lyon, Unite Mixte, Ahmed Mostefaoui, Ahmed Mostefaoui, ...
In a multimedia system, I/O have a dramatic impact on the performance. Therefore, reducing I/O has become a key issue. The latter has been mostly addressed by using buering techniques. In this paper,...
Ecole Normale Sup erieure de (2007)
Ecole Normale, Superieure Lyon, Unite Mixte, Laurent Bienvenu, Laurent Bienvenu, ...
Distributed computing power: from local function to global computing
Informational Track [Page 1] Grid High Performance Networking Research Group (2004)
Grid Working Draft, Volker Sander, Jülich Gmbh, Pham Congduc, Superieure Lyon, Inder Monga, ...
This memo provides information to the Grid community. It does not define any standards or technical recommendations. Distribution is unlimited
A Brief Survey Of The Theory Of The π-Calculus (2003)
Ecole Normale, Superieure Lyon, Unite Mixte, Daniel Hirschkoff
This document collects some important results about the theory of Milner's #-calculus and related formalisms. We present the syntax and semantics of a monadic calculus, and discuss type systems...
Transfer Theorems via Sign Conditions (2000)
Ecole Normale, Superieure Lyon, Unite Mixte, Pascal Koiran, Pascal Koiran
We show that P = PSPACE implies the collapse of the boolean polynomial hierarchy over any structure which admits "efficient enumeration of sign conditions". This fairly rich class of...
Constant Multipliers for FPGAs (2000)
Florent De Dinechin, Vincent Lefèvre, Ecole Normale, Superieure Lyon, Unite Mixte
This paper presents a survey of techniques to implement multiplications by constants on FPGAs. It shows in particular that a simple and well-known technique, canonical signed recoding, can help...
Efficient Communications in Multithreaded Runtime Systems (1999)
Luc Bouge, Jean-François Méhaut, Ecole Normale, Superieure Lyon, Unite Mixte
Most of existing multithreaded environments have an implementation built on top of standard communication interfaces such as MPI which ensures a high level of portability. However, such interfaces do...
The Complexity of Local Dimensions for Constructible Sets (1999)
Ecole Normale, Superieure Lyon, Unite Mixte, Pascal Koiran Janvier, Pascal Koiran
We show that deciding whether an algebraic variety has an irreducible component of codimension at least d is an NP C -complete problem for every xed d (and is in the Arthur-Merlin class if we assume...
A formalization of Static Analyses in System F (1999)
Ecole Normale, Superieure Lyon, Unite Mixte, Frederic Prost
In this paper, we propose a common theoretical framework for type based static functional analyses. The aim is to study the relationships between typing and program analysis. We present a variant of...
SOPHIE: a Tool for Collecting PHiPAC Metrics Of C Code (1999)
Ecole Normale, Superieure Lyon, Thomas Peugeot, Unite Mixte, ...
In designing ecient software for High Performance Real Time embedded signal processing applications, several performance issues must be addressed prior and during implementation. We present a tool...
Deciding Stability and Mortality of Piecewise Ane Dynamical Systems (1999)
Ecole Normale, Superieure Lyon, Unite Mixte, Vincent Blondel Olivier, Olivier Bournez, ...
We show that several global properties (attractivity, global asymptotic stability and mortality) of discrete time dynamical systems dened by iteration of piecewise-ane maps are undecidable. Such...
Towards Portable Hierarchical Placement for FPGAs (1999)
Ecole Normale, Superieure Lyon, Unite Mixte, Florent De Dinechin, Wayne Luk, ...
Field Programmable Gate Arrays (FPGAs) are usually programmed using languages and methods inherited from the domain of VLSI synthesis. These methods, however, have not always been adapted to the new...
The Price of Routing in FPGAs (1999)
Ecole Normale, Superieure Lyon, Unite Mixte, Florent De Dinechin
This paper studies an architectural issue concerning field programmable gate arrays (FPGAs). The observation of mainstream FPGA architectures leads to the following remark: in these circuits, the...
Lower Bounds Are not Easier over the Reals: Inside PH (1999)
Hervé Fournier, Ecole Normale, Superieure Lyon, Unite Mixte, Pascal Koiran March, ...
We prove that all NP problems over the reals with addition and order can be solved in polynomial time with the help of a boolean NP oracle. As a consequence, the "P = NP?" question over the...
The Complexity of Local Dimensions for Constructible Sets (1999)
Ecole Normale, Superieure Lyon, Unite Mixte, Pascal Koiran Janvier, Pascal Koiran
We show that deciding whether an algebraic variety has an irreducible component of codimension at least d is an NP C -complete problem for every xed d (and is in the Arthur-Merlin class if we assume...
Deciding Stability and Mortality of Piecewise Affine Dynamical Systems (1999)
Ecole Normale, Superieure Lyon, Unite Mixte, Vincent Blondel, Olivier Bournez, ...
We show that several global properties (attractivity, global asymptotic stability and mortality) of discrete time dynamical systems defined by iteration of piecewise-affine maps are undecidable. Such...
A Framework for Defining Object-Calculi (Extended Abstract) (1998)
Frédéric Lang, Ecole Normale, Superieure Lyon, Unite Mixte, Pierre Lescanne, ...
Frederic Lang Pierre Lescanne Luigi Liquori Decembre 1998 Research Report N o RR 1998-51 Ecole Normale Sup erieure de Lyon 46 Allee d'Italie, 69364 Lyon Cedex 07, France Telephone :...
A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem (1998)
Ecole Normale, Eric Rémila, Superieure Lyon, Unite Mixte, Claire Kenyon, ...
We present an asymptotic fully polynomial approximation scheme for strippacking, or packing rectangles into a rectangle of fixed width and minimum height, a classical NP -hard cutting-stock problem....
Ecole Normale, Superieure Lyon, Xavier Messeguer, Nicolas Schabanel, Luc Bouge, Joaquim Gabarro, ...
Unite de recherche associee au CNRS n o 1398 Height-relaxed AVL rebalancing: A uni ed, ne-grained approach to concurrent dictionaries