687 citations
- Centre de Recherche en Informatique, Signal et Automatique de LilleFR203 papers
- Université de LilleFR180 papers
- Centre National de la Recherche ScientifiqueFR92 papers
- École Centrale de LilleFR73 papers
- Centre Inria de l'Université de LilleFR30 papers
- Institut national de recherche en sciences et technologies du numériqueFR25 papers
- IMT Nord EuropeFR16 papers
- Université d'ArtoisFR16 papers
- Université Paris-SaclayFR16 papers
- Institut d'Astrophysique SpatialeFR15 papers
- Institut de Recherche en Astrophysique et PlanétologieFR14 papers
- Université Paris 1 Panthéon-SorbonneFR14 papers
8 papers · 1 filter
A determinantal point process for column subset selection
Ayoub Belhadji, Rémi Bardenet, Pierre Chainais
Dimensionality reduction is a first step of many machine learning pipelines. Two popular approaches are principal component analysis, which projects onto a small number of well cho…
Termination of modulo rewriting using the size-change principle (work in progress)
Frédéric Blanqui, Guillaume Genestier
The Size-Change Termination principle was first introduced to study the termination of first-order functional programs. In this work, we show that it can also be used to study the…
Building the Case for Temperature Awareness in Energy Consumption Models: an Application of the Energy-Frequency Convexity Rule
Kameswar Vaddina, Florian Brandner, Gerard Memmi +1
Optimizing computing and communication systems that host energy-critical applications is becoming a key issue for software developers. In previous work, we introduced and validated…
Runtime Analysis of Whole-System Provenance
Thomas Pasquier, Xueyuan Han, Thomas Moyer +5
Identifying the root cause and impact of a system intrusion remains a foundational challenge in computer security. Digital provenance provides a detailed history of the flow of inf…
Polarized Rewriting and Tableaux in B Set Theory
Olivier Hermant
We propose and extension of the tableau-based first-order automated theorem prover Zenon Modulo to polarized rewriting. We introduce the framework and explain the potential benefit…
k-medoids and p-median clustering are solvable in polynomial time for a 2d Pareto front
Nicolas Dupin, Frank Nielsen, El-Ghazali Talbi
This paper examines a common extension of k-medoids and k-median clustering in the case of a two-dimensional Pareto front, as generated by bi-objective optimization approaches. A c…