Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Samuel Tardieu

dblp:45/411 · DBLP profile ↗
← Back
6ranked-venue papers
0as first author
4since 2021 · last 2025
0000-0002-6885-1480ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021Systems, architecture and hardware · 1 · 1 since 2021Computer networks · 1Software engineering, systems software and programming languages · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Efficient and distributed learning · 100%
Software engineering, system software, and programming languages
1 paper
Software maintenance and evolution · 50% Empirical software engineering · 50%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Empirical software engineering
mining software repositories
0.912025
Altered Histories in Version Control System Repositories: Evidence from the Trenches · ASE 2025
Software maintenance and evolution
software ecosystems
0.912025
Altered Histories in Version Control System Repositories: Evidence from the Trenches · ASE 2025
Machine learning › Efficient and distributed learning › model compression › neural network compression
activation compression
0.812024
Activation Map Compression through Tensor Decomposition for Deep Learning · NeurIPS 2024
Machine learning › Efficient and distributed learning
model compression
0.812024
Activation Map Compression through Tensor Decomposition for Deep Learning · NeurIPS 2024
Machine learning › Efficient and distributed learning › model compression › low-rank approximation
tensor decomposition for neural networks
0.812024
Activation Map Compression through Tensor Decomposition for Deep Learning · NeurIPS 2024
Distributed systems › edge computing
edge AI
0.212024
Activation Map Compression through Tensor Decomposition for Deep Learning · NeurIPS 2024

Methods — techniques the papers use, named apart from their topics

singular value decomposition · 1.5high-order singular value decomposition · 1.5empirical study · 0.9
YearPublicationVenuePosition
2025 RESCUE: Multi-Robot Planning Under Resource Uncertainty and Objective Criticality
Franco Cordeiro, Samuel Tardieu, Laurent Pautet
ECRTS2
2025 Altered Histories in Version Control System Repositories: Evidence from the Trenches
Solal Rapaport, Laurent Pautet, Samuel Tardieu, Stefano Zacchiroli
ASE3
2024 Activation Map Compression through Tensor Decomposition for Deep Learning
abstract
Internet of Things and Deep Learning are synergetically and exponentially growing industrial fields with a massive call for their unification into a common framework called Edge AI. While on-device inference is a well-explored topic in recent research, backpropagation remains an open challenge due to its prohibitive computational and memory costs compared to the extreme resource constraints of embedded devices. Drawing on tensor decomposition research, we tackle the main bottleneck of backpropagation, namely the memory footprint of activation map storage. We investigate and compare the effects of activation compression using Singular Value Decomposition and its tensor variant, High-Order Singular Value Decomposition. The application of low-order decomposition results in considerable memory savings while preserving the features essential for learning, and also offers theoretical guarantees to convergence. Experimental results obtained on main-stream architectures and tasks demonstrate Pareto-superiority over other state-of-the-art solutions, in terms of the trade-off between generalization and memory footprint.
Le-Trung Nguyen, Aël Quélennec, Enzo Tartaglione, Samuel Tardieu
NeurIPS4
2021 Litmus-RT plugins for global static scheduling of mixed criticality systems
Laurent Pautet, Thomas Robert 0003, Samuel Tardieu
J. Syst. Archit.3
2012 Building an efficient overlay for publish/subscribe in wireless sensor networks
abstract
In this paper we examine how to efficiently build a brokers overlay to implement publish/subscribe in a wireless sensor network, trying to reduce sensor nodes energy consumption, memory required for buffering packets and delivery time. We evaluate, on the connectivity graph that represents the network, the performance of various criteria that can be used to select brokers among the set of nodes. We compare a dominating set approach with the selection of the best ranked brokers based on centrality measures. We finally give hints on how to implement a distributed algorithm to approximate the most efficient overlays.
Claude Chaudet, Nicola Costagliola, Isabelle M. Demeure, Salma Ktari, Samuel Tardieu
SECON5
2000 GLADE: A Framework for Building Large Object-Oriented Real-Time Distributed Systems
abstract
This paper describes how GLADE, our implementation of the Ada 95 Distributed Systems Annex, can be used to build large object-oriented real-time distributed systems. In addition to the powerful distribution features included in the Ada 95 language itself, we provide extensions to help the programmer build robust and failsafe distributed applications.
Laurent Pautet, Samuel Tardieu
ISORC2