#### Filter Results:

- Full text PDF available (2)

#### Publication Year

1986

2016

- This year (0)
- Last 5 years (2)
- Last 10 years (4)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Stéphane Robin, Avner Bar-Hen, Jean-Jacques Daudin, Laurent Pierre
- Computational Statistics & Data Analysis
- 2007

- Pierre Chaussecourte, Birte Glimm, Ian Horrocks, Boris Motik, Laurent Pierre
- International Semantic Web Conference
- 2013

The EMA (Energy Management Adviser) aims to produce personalised energy saving advice for EDF's customers. The advice takes the form of one or more 'tips', and personalisation is achieved using semantic technologies: customers are described using RDF, an OWL on-tology provides a conceptual model of the relevant domain (housing, environment, and so on) and… (More)

- Jean-Jacques Daudin, Laurent Pierre, Corinne Vacher
- Biometrics
- 2010

The mixture model is a method of choice for modeling heterogeneous random graphs, because it contains most of the known structures of heterogeneity: hubs, hierarchical structures, or community structure. One of the weaknesses of mixture models on random graphs is that, at the present time, there is no computationally feasible estimation method that is… (More)

- Laurent Pierre, Jean-Marc Farinone
- ITA
- 1990

- Laurent Pierre
- Theor. Comput. Sci.
- 1992

Most research work in the field of automatic programming has been focused on conceptually complex problems. However, although most of the programs we are generally faced with may be very big and manage large volumes of data, they are conceptually simple. Starting from this consideration, we have developed, since 1992, a system called DESCARTES which, fully… (More)

- Laurent Pierre, Sylviane R. Schwer
- Acta Informatica
- 1989

The rational index ρL of a non-empty language L is a function of ℕ into ℕ, whose asymptotic behavior can be used to classify languages. We prove that the languages associated to Vector Addition System or Petri nets have rational indexes bounded by polynomials. This situation should be contrasted with the case of context-free languages. Indeed some… (More)

- Jean-Luc Deleage, Laurent Pierre
- Theor. Comput. Sci.
- 1986

- Laurent Pierre
- ArXiv
- 2016

Fortuitous sequences of flips of the top of a stack of n burnt pancakes for all n > 24. Summary Burnt pancakes problem was defined by Gates and Papadimitriou in 1979. They proved that g(−f n) ≥ 3n/2 − 1. In 1995 Cohen and Blum conjectured that g(n) = g(−I n) and proved that g(−I n) = g(−f n) + 1 ≥ 3n/2.