471 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Institut national de recherche en sciences et technologies du numériqueFR21 papers
- École Normale Supérieure - PSLFR17 papers
- Centre National de la Recherche ScientifiqueFR8 papers
- University of FloridaUS7 papers
- Département d'InformatiqueFR6 papers
- KTH Royal Institute of TechnologySE4 papers
- Télécom ParisFR4 papers
- The University of Texas at AustinUS4 papers
- Eindhoven University of TechnologyNL3 papers
- École Normale SupérieureBI2 papers
- Laboratoire des signaux et systèmesFR2 papers
- Microsoft (United States)US2 papers
6 papers · 1 filter
Estimation and Control of Quality of Service in Demand Dispatch
Yue Chen, Ana Bušić, Sean Meyn
It is now well known that flexibility of energy consumption can be harnessed for the purposes of grid-level ancillary services. In particular, through distributed control of a coll…
Eternal Family Trees and Dynamics on Unimodular Random Graphs
François Baccelli, Mir-Omid Haji-Mirsadeghi, Ali Khezeli
This paper is centered on covariant dynamics on unimodular random graphs and random networks, namely maps from the set of vertices to itself which are preserved by graph or network…
Limit theory for geometric statistics of point processes having fast decay of correlations
B. Blaszczyszyn, D. Yogeshwaran, J. E. Yukich
Let be a simple,stationary point process having fast decay of correlations, i.e., its correlation functions factorize up to an additive error decaying faster than any power of…
Cell planning for mobility management in heterogeneous cellular networks
Arpan Chattopadhyay, Bartłomiej Błaszczyszyn, Eitan Altman
In small cell networks, high mobility of users results in frequent handoff and thus severely restricts the data rate for mobile users. To alleviate this problem, we propose to use…
Multipath streaming: fundamental limits and efficient algorithms
Richard Combes, Habib Sidi, Salah-Eddine Elayoubi
We investigate streaming over multiple links. A file is split into small units called chunks that may be requested on the various links according to some policy, and received after…
Clustering from Sparse Pairwise Measurements
Alaa Saade, Marc Lelarge, Florent Krzakala +1
We consider the problem of grouping items into clusters based on few random pairwise comparisons between the items. We introduce three closely related algorithms for this task: a b…