Publications related to Information, Calcul, Communication: Introduction à la pensée informatique

Results on Sparse Integer Programming and Geometric Independent Sets

An integer linear program is a problem of the form max{c^T x : Ax=b, x >= 0, x integer}, where A is in Z^(n x m), b in Z^m, and c in Z^n.Solving an integer linear program is NP-hard in general, but there are several assumptions for which it becomes fixed p ...

EPFL2023

Motor-Unit Ordering of Blindly-Separated Surface-EMG Signals for Gesture Recognition

Pasquale Davide Schiavone, Elisa Donati

Hand gestures are one of the most natural and expressive way for humans to convey information, and thus hand gesture recognition has become a research hotspot in the human-machine interface (HMI) field. In particular, biological signals such as surface ele ...

SPRINGER INTERNATIONAL PUBLISHING AG2023

Referencing in YouTube Knowledge Communication Videos

Daniel Gatica-Perez, Haeeun Kim

In recent years, there has been widespread concern about misinformation and hateful content on social media that are damaging societies. Being one of the most influential social media that practically serves as a newsearch engine, YouTube has accepted crit ...

New York2023

Model Predictive Control for Multi-Agent Systems under Limited Communication and Time-Varying Network Topology

Danilo Saccani, Melanie Nicole Zeilinger

In control system networks, reconfiguration of the controller when agents are leaving or joining the network is still an open challenge, in particular when operation constraints that depend on each agent's behavior must be met. Drawing our motivation from ...

New York2023

Byzantine consensus is Θ(n^2): the Dolev-Reischuk bound is tight even in partial synchrony!

Rachid Guerraoui, Jovan Komatovic, Pierre Philippe Civit, Manuel José Ribeiro Vidigueira, Vincent Gramoli, Seth Gilbert

The Dolev-Reischuk bound says that any deterministic Byzantine consensus protocol has (at least) quadratic (in the number of processes) communication complexity in the worst case: given a system with n processes and at most f < n/3 failures, any solution t ...

2023

Approximation Algorithms for Allocation and Network Design

Etienne Michel François Bamas

In this thesis, we give new approximation algorithms for some NP-hard problems arising in resource allocation and network design. As a resource allocation problem, we study the Santa Claus problem (also known as the MaxMin Fair Allocation problem) in which ...

EPFL2023

Curiosity-driven exploration: foundations in neuroscience and computational modeling

Wulfram Gerstner, Alireza Modirshanechi

Curiosity refers to the intrinsic desire of humans and animals to explore the unknown, even when there is no apparent reason to do so. Thus far, no single, widely accepted definition or framework for curiosity has emerged, but there is growing consensus th ...

Cambridge2023

Diffusion of energy technologies: the role and dynamics of supply-side information networks

Claudia Rebeca Binder Signer, Romano Tobias Wyss, Gloria Serra Coch, Maria Anna Hecher

The diffusion of energy technologies is key for supporting the energy transition. While social influence and peer effects have been extensively studied on the demand side and found to impact adoption, less focus has been given to the role of information ne ...

2023

Framework to evaluate the value of monitoring-technique information for structural performance monitoring

Eugen Brühwiler, Numa Joy Bertola

The management of existing civil infrastructure is becoming more crucial as a large share of bridges is approaching their theoretical end of service duration. Structural performance monitoring aims to verify bridge safety at a given time, and it should be ...

2023

Moments of the number of points in a bounded set for number field lattices

Maryna Viazovska, Nihar Prakash Gargava, Vlad Serban

We examine the moments of the number of lattice points in a fixed ball of volume

V

for lattices in Euclidean space which are modules over the ring of integers of a number field

K

. In particular, denoting by

ω_K

the number of roots of unity in

K

, we ...

arXiv2023

Information, Calcul, Communication: Introduction à la pensée informatique

Graph Chatbot

Chat with Graph Search

Results on Sparse Integer Programming and Geometric Independent Sets

Motor-Unit Ordering of Blindly-Separated Surface-EMG Signals for Gesture Recognition

Referencing in YouTube Knowledge Communication Videos

Model Predictive Control for Multi-Agent Systems under Limited Communication and Time-Varying Network Topology

Byzantine consensus is Θ(n^2): the Dolev-Reischuk bound is tight even in partial synchrony!

Approximation Algorithms for Allocation and Network Design

Curiosity-driven exploration: foundations in neuroscience and computational modeling

Diffusion of energy technologies: the role and dynamics of supply-side information networks

Framework to evaluate the value of monitoring-technique information for structural performance monitoring

Moments of the number of points in a bounded set for number field lattices

Approximation Algorithms for Allocation and Network Design

Byzantine consensus is Θ(n^2): the Dolev-Reischuk bound is tight even in partial synchrony!

Moments of the number of points in a bounded set for number field lattices

Results on Sparse Integer Programming and Geometric Independent Sets

Model Predictive Control for Multi-Agent Systems under Limited Communication and Time-Varying Network Topology

Motor-Unit Ordering of Blindly-Separated Surface-EMG Signals for Gesture Recognition

Referencing in YouTube Knowledge Communication Videos

Curiosity-driven exploration: foundations in neuroscience and computational modeling

Diffusion of energy technologies: the role and dynamics of supply-side information networks

Framework to evaluate the value of monitoring-technique information for structural performance monitoring