mirage

Browsing LIP - Laboratoire de l'Informatique du Parallélisme by Title

DSpace/Manakin Repository

Browsing LIP - Laboratoire de l'Informatique du Parallélisme by Title

Sort by: Order: Results:

  • A Kleene Theorem for Piecewise Constant Signals Automata (extended abstract).
    Laboratoire de l'informatique du parallélisme; Durand-Lose, Jérôme (2002-11)
    (eng) In this paper, we consider timed automata for piecewise constant signals.In the model presented here, time elapses only during transitions; any constraint on clocks should be satisfied during all the duration of the ...
  • Knowledge Extraction From Neural Networks : A Survey
    Laboratoire de l'informatique du parallélisme; Baron, Richard (1994-05-27)
    (eng) Artificial neural networks may learn to solve arbitrary complex problems. But knowledge acquired is hard to exhibit. Thus neural networks appear as ``black boxes'', the decisions of which can't be explained. In this ...
  • The language X: circuits, computations and Classical Logic
    Laboratoire de l'informatique du parallélisme; Van Bakel, Steffen; Lengrand, Stéphane; Lescanne, Pierre (2005-03)
    (eng) X is an untyped language for describing circuits by composition of basic components. This language is well suited to describe structures which we call "circuits" and which are made of parts that are connected by ...
  • Large scale execution of a bioinformatic application on a volunteer grid
    Bertis, Viktors; Bolze, Raphaël; Desprez, Frédéric; Reed, Kevin; Laboratoire de l'informatique du parallélisme (LIP, 2007-12)
    (eng) Scheduling problems are already difficult on traditional parallel machines. They become extremely challenging on heterogeneous clusters, even when embarrassingly parallel applications are considered. In this paper ...
  • La théorie des cofinalités possibles et ses applications.
    Laboratoire de l'informatique du parallélisme; Lafitte, Grégory (1999-09)
    (eng) Cardinal arithmetic, which has given birth to set theory,seemed to be until lately either simple (addition and multiplication ofinfinite cardinals are simple), or quite elastic (by forcing methods, it seemed possible ...
  • Lattice-Based Memory Allocation
    Laboratoire de l'informatique du parallélisme; Darte, Alain; Schreiber, Rob; Villard, Gilles (2004-04)
    (eng) We investigate the technique of storing multiple array elements in the same memory cell, with the goal of reducing the amount of memory used by an array variable. This reduction is both important and achievable during ...
  • Lattices of Tilings and Stability.
    Laboratoire de l'informatique du parallélisme; Caspard, Nathalie; Morvan, Michel; Remila, Eric; Thierry, Eric (2003-04)
    (eng) Many tiling spaces such as domino tilings of fixed figures have an underlying lattice structure. This lattice structure corresponds to the dynamics induced by flips. In this paper, we further investigate the properties ...
  • Lattices of tilings : an extension to figures with holes.
    Laboratoire de l'informatique du parallélisme; Rémila, Eric (2001-12)
    (eng) We first prove that the set of domino tilings of a fixed finite figure is a distributive lattice, even in the case when the figure has holes. Afterwards, we give a geometrical interpretation of the order given by ...
  • Leader Election by d Dimensional Cellular Automata
    Laboratoire de l'informatique du parallélisme; Nichitiu, Codrin; Remila, Eric (1999-01)
    (eng) We present a cellular algorithm in O(w^2) for the leader election problem on a finite connected subset F of Z^d of diameter w, for any fixed d. The problem consists in finding an algorithm such that when setting the ...
  • Leader Election without Compass in Some Hyperbolic and Euclidean Cellular Automata.
    Laboratoire de l'informatique du parallélisme; Nichitiu, Codrin; Papazian, Christophe; Remila, Eric (2001-02)
    (eng) We present a linear time algorithm for the networking and distributed computing problem of leader election (LE). Given a graph, its vertices represent processors (here finite state machines), and its edges communication ...
  • Length and Number of Buses for Gossiping in Networks
    Laboratoire de l'informatique du parallélisme; Fraigniaud, Pierre; Laforest, Christian (1994-09-21)
    (eng) Gossiping is an information dissemination problem in which each node of a communication network has a unique piece of information that must be transmitted to all the other nodes. A bus network is a network of processing ...
  • Les nouveaux codecs : un état de l'art
    Laboratoire de l'informatique du parallélisme; Mignot, Jean-Christophe (2000-12)
    (eng) This paper presents a survey of the state-of-the-art techniques and prototypes for compressing videos. A particular interest is devoted to compression for streaming over the Internet. The basic principles are presented, ...
  • The limit theory of generic polynomials
    Laboratoire de l'informatique du parallélisme; Koiran, Pascal (2001-09)
    (eng) We show that the set T of first-order sentences satisfied by all generic polynomials of sufficiently high degree forms a complete theory. As a consequence, complex polynomials of even degree cannot be distinguished ...
  • LinBox: A Generic Library for Exact Linear Algebra
    Laboratoire de l'informatique du parallélisme; Dumas, J.G.; Gautier, T.; Giesbrecht, M.; Giorgi, Pascal; Hovinen, B.; Kaltofen, Erich; Saunders, B.D.; Turner, W.J.; Villard, Gilles (2002-03)
    (eng) LinBox is a high-performance generic software library for black box linear algebra over symbolic (exact) entry domains. The generic software methodology enables the user to instantiate the procedures in the library ...
  • Linux Activations : un support système performant pour les applications de calcul multithreads
    Laboratoire de l'informatique du parallélisme; Danjean, Vincent (2000-03)
    (eng) In this paper, we present LinuxActivation, an efficient system support for user level thread scheduling implemented within Linux. This work is an extension to the ``Scheduler Activations'' model (proposed by Anderson ...
  • Listing all potential maximal cliques of a graph.
    Laboratoire de l'informatique du parallélisme; Bouchitté, Vincent; Todinca, Ioan (1999-09)
    (eng) A potential maximal clique of a graph is a vertex set that induces a maximal clique in some minimal triangulation of that graph. It is known that if these objects can be listed in polynomial time for a class of graphs, ...
  • Listing all the minimal separators of a 3-connected planar graph.
    Laboratoire de l'informatique du parallélisme; Mazoit, Frédéric (2004-02)
    (eng) I present an efficient algorithm which lists the minimal separators of a 3-connected planar graph in $O(n)$ per separator.
  • Listing all the minimal separators of a planar graph.
    Laboratoire de l'informatique du parallélisme; Mazoit, Frédéric (2004-06)
    (eng) I present an efficient algorithm which lists the minimal separators of a planar graph in O(n) per separator.
  • Load balancing HPF programs by migrating virtual processors
    Laboratoire de l'informatique du parallélisme; Perez, Christian (1996-10)
    (eng) This paper explores the integration of load balancing features in the data parallel language HPF targeting semi-regular applications. We show that the HPF virtual processors are good candidates to be the unit of ...

Search DSpace


Advanced Search

Browse

My Account

Bookmark and Share