Concept

Models of communication

Publications associées (253)

3D diffractive optics for linear interconnects and nonlinear processing

The optical domain presents potential avenues for enhancing both computing and communication due to its inherentproperties of bandwidth, parallelism, and energy efficiency. This research focuses on harnessing 3-Dimensional (3D)diffractive optics for novel ...

EPFL2024

A digital bridge between brain and spinal cord restores walking after paralysis

Grégoire Courtine, Jocelyne Bloch

Spinal-cord injury interrupts communication between the brain and spinal cord, leading to paralysis. An implant that decodes the brain signals that control movements and drives electrical stimulation of the spinal cord re-establishes this communication, en ...

NATURE PORTFOLIO2023

The evolution of behavioral cues and signaling in displaced communication

Dario Floreano, Laurent Keller

Displaced communication, whereby individuals communicate regarding a subject that is not immediately present (spatially or temporally), is one of the key features of human language. It also occurs in a few animal species, most notably the honeybee, where t ...

2023

Genomics and conservation: Guidance from training to analyses and applications

Annie Sandrine Guillaume

Environmental change is intensifying the biodiversity crisis and threatening species across the tree of life. Conservation genomics can help inform conservation actions and slow biodiversity loss. However, more training, appropriate use of novel genomic me ...

Hoboken2023

Non-verbal Communication between Humans and Robots: Imitation, Mutual Understanding and Inferring Object Properties

Nuno Ricardo Ferreira Duarte

Humans can express their actions and intentions, resorting to verbal and/or non-verbal communication. In verbal communication, humans use language to express, in structured linguistic terms, the desired action they wish to perform. Non-verbal communication ...

EPFL2023

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

Hybrid Wireless-Local Communication via Information Propagation for Modular Robotic Synchronization Applications

Jamie Paik, Kevin Andrew Holdcroft, Christoph Heinrich Belke, Alexander Thomas Sigrist

Modular robots hold promise of adaptability, robustness, and versatility. Synchronization of modules is critical; if a module is asynchronous, not only will the robot fail to perform tasks properly, but its behavior may be self-destructive through self-col ...

WILEY2022

Exploring Photoredox-Catalyzed (Re)functionalizations with Core-Modified Benziodoxolones

Jérôme Waser, Franck Le Vaillant, Stephanie Grace Elizabeth Amos

Alkynes and nitriles are valuable building blocks in organic synthesis and also have multiple applications in chemical biology and materials science. Due to the high availability of tertiary alcohols, developing methods for their conversion into alkynes an ...

WILEY-V C H VERLAG GMBH2022

Communication Complexity of Collision

Mika Tapani Göös, Siddhartha Jain

The Collision problem is to decide whether a given list of numbers (x_1,…,x_n) ∈ [n]ⁿ is 1-to-1 or 2-to-1 when promised one of them is the case. We show an n^Ω(1) randomised communication lower bound for the natural two-party version of Collision where Ali ...

Leibniz-Zentrum für Informatik2022

Proofs, Circuits, and Communication

Mika Tapani Göös

We survey lower-bound results in complexity theory that have been obtained via newfound interconnections between propositional proof complexity, boolean circuit complexity, and query/communication complexity. We advocate for the theory of total search prob ...

2022

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search