From the 1 of 5.5k papers with an AI index.
29.3k citations
- Centre National de la Recherche ScientifiqueFR1.7k papers
- Centre Inria de SaclayFR364 papers
- École PolytechniqueFR306 papers
- Laboratoire Lorrain de Recherche en Informatique et ses ApplicationsFR300 papers
- École Normale Supérieure - PSLFR292 papers
- Sorbonne UniversitéFR291 papers
- École Normale Supérieure de LyonFR233 papers
- Centre Inria de l'Université Grenoble AlpesFR216 papers
- Université Paris-SaclayFR208 papers
- Université Grenoble AlpesFR204 papers
- Lyon 1 UniversitéFR191 papers
- Centre Inria d'Université Côte d'AzurFR183 papers
301 papers · 1 filter
Best approximation in max-plus semimodules
Marianne Akian, Stephane Gaubert, Viorel Nitica +1
We establish new results concerning projectors on max-plus spaces, as well as separating half-spaces, and derive an explicit formula for the distance in Hilbert's projective metric…
Adiabatic passage and ensemble control of quantum systems
Zaki Leghtas, Alain Sarlette, Pierre Rouchon
This paper considers population transfer between eigenstates of a finite quantum ladder controlled by a classical electric field. Using an appropriate change of variables, we show…
Proceedings International Workshop on Strategies in Rewriting, Proving, and Programming
Hélène Kirchner, César Muñoz
This volume contains selected papers from the proceedings of the First International Workshop on Strategies in Rewriting, Proving, and Programming (IWS 2010), which was held on Jul…
Non-redundant random generation from weighted context-free languages
Yann Ponty
We address the non-redundant random generation of k words of length n from a context-free language. Additionally, we want to avoid a predefined set of words. We study the limits of…
Differential Privacy versus Quantitative Information Flow
Mário S. Alvim, Konstantinos Chatzikokolakis, Pierpaolo Degano +1
Differential privacy is a notion of privacy that has become very popular in the database community. Roughly, the idea is that a randomized query mechanism provides sufficient priva…
List-decoding of binary Goppa codes up to the binary Johnson bound
Daniel Augot, Morgan Barbier, Alain Couvreur
We study the list-decoding problem of alternant codes, with the notable case of classical Goppa codes. The major consideration here is to take into account the size of the alphabet…