81 citations
- Institutt for Grafiske MedierNO25 papers
- Université Gustave EiffelFR25 papers
- Centre National de la Recherche ScientifiqueFR10 papers
- Laboratoire d'Informatique, du Traitement de l'Information et des SystèmesFR4 papers
- Lyon 1 UniversitéFR4 papers
- Laboratoire d'Informatique de Paris-NordFR3 papers
- Université de Rouen NormandieFR3 papers
- Université Paris CitéFR3 papers
- Délégation Paris 7FR2 papers
- Laboratoire de Mathématiques d'OrsayFR2 papers
- Laboratoire de Physique ThéoriqueFR2 papers
- Laboratoire d'Informatique Algorithmique: Fondements et ApplicationsFR2 papers
6 papers · 1 filter
Idempotents with polynomial coefficients
Alain Lascoux
We combine Young idempotents in the group algebra of the symmetric group with the action of the symmetric group on products of Vandermonde determinants to obtain idempotents with p…
Minimization of Automata
Jean Berstel, Luc Boasson, Olivier Carton +1
This chapter is concerned with the design and analysis of algorithms for minimizing finite automata. Getting a minimal automaton is a fundamental issue in the use and implementatio…
Constructions définitoires des tables du Lexique-Grammaire
Elsa Tolone, Stavroula Voyatzi, Christian Leclère
Lexicon-Grammar tables are a very rich syntactic lexicon for the French language. This linguistic database is nevertheless not directly suitable for use by computer programs, as it…
A generic tool to generate a lexicon for NLP from Lexicon-Grammar tables
Matthieu Constant, Elsa Tolone
Lexicon-Grammar tables constitute a large-coverage syntactic lexicon but they cannot be directly used in Natural Language Processing (NLP) applications because they sometimes rely…
Les Entités Nommées : usage et degrés de précision et de désambiguïsation
Claude Martineau, Elsa Tolone, Stavroula Voyatzi
The recognition and classification of Named Entities (NER) are regarded as an important component for many Natural Language Processing (NLP) applications. The classification is usu…
On the equivalence between hierarchical segmentations and ultrametric watersheds
Laurent Najman
We study hierarchical segmentation in the framework of edge-weighted graphs. We define ultrametric watersheds as topological watersheds null on the minima. We prove that there exis…