output
20022011
most citedSome extensions of the uncertainty principle

81 citations

Showing 2010Show all

6 papers · 1 filter

math.CO2010

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…

cs.FL20108 cited

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…

cs.CL20101 cited

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…

cs.CL20109 cited

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…

cs.CL20105 cited

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…

cs.DM201063 cited

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…