Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
This work describes a fast fully homomorphic encryption scheme over the torus (TFHE) that revisits, generalizes and improves the fully homomorphic encryption (FHE) based on GSW and its ring variants. The simplest FHE schemes consist in bootstrapped binary ...
Wasserstein distances are metrics on probability distributions inspired by the problem of optimal mass transportation. Roughly speaking, they measure the minimal effort required to reconfigure the probability mass of one distribution in order to recover th ...
ANNUAL REVIEWS2019
,
The growth and establishment of riparian vegetation on river bedforms is of hydrological as well as ecological importance as it helps in enhancing spatial heterogeneity and thus the biodiversity of river corridors. Yet, during floods, flow drag and scourin ...
AGU2019
,
We use results from communication complexity, both new and old ones, to prove lower bounds for unambiguous finite automata (UFAs). We show three results. 1) Complement: There is a language L recognised by an n-state UFA such that the complement language ...
Schloss Dagstuhl - Leibniz-Zentrum für Informatik2022
The traditional synthesis question given a specification asks for the automatic construction of a system that satisfies the specification, whereas often there exists a preference order among the different systems that satisfy the given specification. Under ...
We consider a general discrete state-space system with both unidirectional and bidirectional links. In contrast to bidirectional links, there is no reverse transition along the unidirectional links Herein, we first compute the statistical length and the th ...
Consider a finite set of sources, each producing independent identically distributed observations that follow a unique probability distribution on a finite alphabet. We study the problem of matching a finite set of observed sequences to the set of sources ...
Institute of Electrical and Electronics Engineers2015
The problem of control synthesis to maximize the probability of satisfying automata specifications for systems with uncertainty is addressed. Two types of uncertainty are considered; stochasticity in the dynamical system and in the sets defining the specif ...
2017
, , ,
Systems and methods for tracking interacting objects may acquire, with a sensor, and two or more images associated with two or more time instances. A processor may generate image data from the two or more images. The processor may apply an extended Probabi ...
2015
Studying the complexity of distributed algorithms typically boils down to evaluating how the number of messages exchanged (resp. communication steps performed or shared memory operations executed) by nodes to reliably achieve some common task, evolves with ...
