From the 1 of 1.2k papers with an AI index.
29.3k citations
- F. Rossi2 profiles18 · h 27
- F. Bach17 · h 108
- S. Tixeuil2 profiles16 · h 35
- Francis Bach3 profiles15
- Laurent Romary3 profiles15 · h 26
- Konstantin Avrachenkov2 profiles14 · h 41
- Marc Schoenauer2 profiles14 · h 49
- S. Vérel13 · h 28
- Alin Bostan2 profiles10 · h 30
- B. Mourrain10 · h 44
- Fabien Mathieu2 profiles10 · h 15
- Laetitia Vermeulen-Jourdan10 · h 26
- Centre National de la Recherche ScientifiqueFR149 papers
- Laboratoire Lorrain de Recherche en Informatique et ses ApplicationsFR132 papers
- Centre Inria de SaclayFR125 papers
- Centre Inria de l'Université de LilleFR63 papers
- Institut de Recherche en Informatique et Systèmes AléatoiresFR50 papers
- Université Grenoble AlpesFR47 papers
- Centre Inria de l'université de BordeauxFR42 papers
- Sorbonne UniversitéFR42 papers
- Centre Inria de l'Université de LorraineFR36 papers
- École PolytechniqueFR34 papers
- Institut Élie Cartan de LorraineFR34 papers
- LIP6FR32 papers
133 papers · 1 filter
Gradient waveform design for variable density sampling in Magnetic Resonance Imaging
Nicolas Chauffert, Pierre Weiss, Jonas Kahn +1
Fast coverage of k-space is a major concern to speed up data acquisition in Magnetic Resonance Imaging (MRI) and limit image distortions due to long echo train durations. The hardw…
Optimal Design for Purcell Three-link Swimmer
Laetitia Giraldi, Pierre Martinon, Marta Zoppello
In this paper we address the question of the optimal design for the Purcell 3-link swim-mer. More precisely we investigate the best link length ratio which maximizes its displace-m…
Accurate Community Detection in the Stochastic Block Model via Spectral Algorithms
Se-Young Yun, Alexandre Proutiere
We consider the problem of community detection in the Stochastic Block Model with a finite number of communities of sizes linearly growing with the network size . This model…
Robust Topological Inference: Distance To a Measure and Kernel Distance
Frédéric Chazal, Brittany T. Fasy, Fabrizio Lecci +3
Let P be a distribution with support S. The salient features of S can be quantified with persistent homology, which summarizes topological features of the sublevel sets of the dist…
The Next 700 Impossibility Results in Time-Varying Graphs
Nicolas Braud-Santoni, Swan Dubois, Mohamed-Hamza Kaaouachi +1
We address highly dynamic distributed systems modeled by time-varying graphs (TVGs). We interest in proof of impossibility results that often use informal arguments about convergen…
A Storage-Efficient and Robust Private Information Retrieval Scheme Allowing Few Servers
Daniel Augot, Françoise Levy-Dit-Vehel, Abdullatif Shikfa
Since the concept of locally decodable codes was introduced by Katz and Trevisan in 2000, it is well-known that information the-oretically secure private information retrieval sche…