Laboratoire d'informatique fondamentale de Marseille
UMR 6166 - CNRS, Université de la Méditerranée, Université de Provence
Consultation
Derniers dépôts
Liste des articles
Liste par équipe
Liste par date
Liste par domaine
Liste par auteurs
Rechercher
106 articles – 48 Notices
[english version]
.:.
Consultation
>
Liste des articles
.:.
154 documents classés par :
Date
Titre
Nom du premier auteur
Type de documents
Date de dépôt
1
-
2
-
3
-
4
-
5
-
6
-
7
...
Two-by-two Substitution Systems and the Undecidability of the Domino Problem
Ollinger N.
[hal-00204625 - version 2] (03/03/2008)
A Polynomial Algorithm for the Inference of Context Free Languages
Clark A., Eyraud R., Habrard A.
Dans
Proceeding of the 9th International Colloquium on Grammatical Inference, ICGI 2008
-
9th International Colloquium on Grammatical Inference - ICGI 2008
, France (2008) [hal-00348673 - version 1]
Local terminations and distributed computability in anonymous networks
Chalopin J., Godard E., Métivier Y.
Dans
Distributed computing
-
International symposium on distributed computing (DISC)
, France (2008) [hal-00332759 - version 1]
Finding a Minimum Medial Axis of a Discrete Shape is NP-hard
Coeurjolly D., Hulin J., Sivignon I.
Theoretical Computer Science
206
, 1-2 (2008) 72-79 [hal-00332406 - version 1]
Relevant Representations for the Inference of Rational Stochastic Tree Languages
Denis F., Gilbert E., Habrard A., Ouardi F., Tommasi M.
Dans
Proceedings of the 9th International Colloquium on Grammatical Inference
-
International Colloquium on Grammatical Inference
, France (2008) [hal-00293511 - version 3]
Finding a Vector Orthogonal to Roughly Half a Collection of Vectors
Charbit P., Jeandel E., Koiran P., Perifel S., Thomassé S.
Journal of Complexity
24
(2008) 39-53 [lirmm-00292703 - version 1]
Recherche locale haute performance pour la planification des interventions à France Télécom
Estellon B., Gardi F., Nouioua K.
JFPC 2008- Quatrièmes Journées Francophones de Programmation par Contraintes
, France (2008) [inria-00290811 - version 1]
Learning Probabilistic Models of Tree Edit Distance
Bernard M., Boyer L., Habrard A., Sebban M.
Pattern Recognition
41
, 8 (2008) 2611-2629 [hal-00224992 - version 1]
Computing the JTH solution of a first-order query
Bagan G., Durand A., Grandjean E., Olive F.
RAIRO - Theoretical Informatics and Applications
, 42 (2008) 147-164 [hal-00221730 - version 1]
Towards a sharing strategy for the graph rewriting calculus
Baldan P., Bertolissi C., Cirstea H., Kirchner C.
7th International Workshop on Reduction Strategies in Rewriting and Programming - WRS 2007
, France (2007) [inria-00186141 - version 1]
Factorization (Splitting)
Schlechta K.
[hal-00201395 - version 1] (28/12/2007)
Undirected Graphs of Entanglement Two
Belkhir W., Santocanale L.
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science
, Inde (2007) [hal-00144355 - version 2]
Let's get the student into the driver's seat
Zock M., Afantenos S. D.
[hal-00191997 - version 1] (26/11/2007)
Congruences of Multinomial Lattices
Santocanale L.
Order
24
, 3 (2007) 155--179 [hal-00142355 - version 1]
An Algorithmic Framework for Convex Mixed Integer Nonlinear Programs
Bonami P., Biegler L. T., Conn A. R., Cornuéjols G., Grossmann I. E., Laird C. D., Lee J., Lodi A., Margot F., Sawaya N. et al
Discrete Optimization
5
, 2 (2007) 186-204 [hal-00421753 - version 1]