Concept

Théorie de la démonstration

Publications associées (150)

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

Scaling Functional Synthesis and Repair

Emmanouil Koukoutos

Program synthesis was first proposed a few decades ago, but in the last decade it has gained increased momentum in the research community. The increasing complexity of software has dictated the urgent need for improved supporting tools that verify the soft ...

EPFL2019

The adaptive interpolation method: a simple scheme to prove replica formulas in Bayesian inference

Nicolas Macris, Jean François Emmanuel Barbier

In recent years important progress has been achieved towards proving the validity of the replica predictions for the (asymptotic) mutual information (or free energy) in Bayesian inference problems. The proof techniques that have emerged appear to be quite ...

SPRINGER HEIDELBERG2019

Time-resolved analysis of dynamic graphs: an extended Slepian design

Dimitri Nestor Alice Van De Ville, Raphaël Pierre Liégeois, Ibrahim Merad

Graphs are extensively used to represent networked data. In many applications, especially when considering large datasets, it is a desirable feature to focus the analysis onto specific subgraphs of interest. Slepian theory and its extension to graphs allow ...

SPIE-INT SOC OPTICAL ENGINEERING2019

The Scaling Limit Of Critical Ising Interfaces Is Cle3

Clément Hongler

In this paper, we consider the set of interfaces between + and - spins arising for the critical planar Ising model on a domain with + boundary conditions, and show that it converges to nested CLE3. Our proof relies on the study of the coupling between the ...

INST MATHEMATICAL STATISTICS2019

A central limit theorem for integrals of random waves

Marius Christopher Lemm, Matthew De Courcy-Ireland

We derive a central limit theorem for the mean-square of random waves in the high-frequency limit over shrinking sets. Our proof applies to any compact Riemannian manifold of arbitrary dimension, thanks to the universality of the local Weyl law. The key te ...

2019

A logarithmic epiperimetric inequality for the obstacle problem

Maria Colombo

We study the regularity of the regular and of the singular set of the obstacle problem in any dimension. Our approach is related to the epiperimetric inequality of Weiss (Invent Math 138:23-50, Wei99a), which works at regular points and provides an alterna ...

2018

Some Proofs of Conditional and Joint Biases in RC4 Stream Cipher

Subhadeep Banik

In this paper we present proofs for the new biases in RC4 which were experimentally found and listed out (without theoretical justifi- cations and proofs) in a paper by Vanhoef et al. in USENIX 2015. Their purpose was to exploit the vulnerabilities of RC4 ...

2018

Theoretical Understanding of Some Conditional and Joint Biases in RC4 Stream Cipher

Subhadeep Banik

In this paper we present proofs for the new biases in RC4 which were experimentally found and listed out (without theoretical justifications and proofs) in a paper by Vanhoef et al. in USENIX 2015. Their purpose was to exploit the vulnerabilities of RC4 in ...

IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG2018

Convergence Of Variance-Reduced Learning Under Random Reshuffling

Ali H. Sayed, Bicheng Ying, Kun Yuan

Several useful variance-reduced stochastic gradient algorithms, such as SVRG, SAGA, Finito, and SAG, have been proposed to minimize empirical risks with linear convergence properties to the exact minimizers. The existing convergence results assume uniform ...

IEEE2018

Secure Storage with Replication and Transparent Deduplication

Iraklis Leontiadis

We seek to answer the following question: To what extent can we deduplicate replicated storage ? To answer this question, we design ReDup, a secure storage system that provides users with strong integrity, reliability, and transparency guarantees about dat ...

2018