Publications associées (35)

Extractable Witness Encryption for the Homogeneous Linear Equations Problem

Serge Vaudenay, Bénédikt Minh Dang Tran

Witness encryption is a cryptographic primitive which encrypts a message under an instance of an NP language and decrypts the ciphertext using a witness associated with that instance. In the current state of the art, most of the witness encryption construc ...
Springer2023

Weakly nonlinear versus semi-linear models of the nonlinear evolution of the centrifugal instability

François Gallaire, Eunok Yim

We carry out a weakly nonlinear analysis of the centrifugal instability for a columnar vortex in a rotating fluid, and compare the results to those of the semi-linear model derived empirically by Yim et al. (J. Fluid Mech., vol. 897, 2020, A34). The asympt ...
CAMBRIDGE UNIV PRESS2023

On Preconditioning of Decentralized Gradient-Descent When Solving a System of Linear Equations

Nirupam Gupta

This article considers solving an overdetermined system of linear equations in peer-to-peer multiagent networks. The network is assumed to be synchronous and strongly connected. Each agent has a set of local data points, and their goal is to compute a line ...
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2022

A fast algorithm to find reduced hyperplane unit cells and solve N-dimensional Bezout's identities

Cyril Cayron

Deformation twinning on a plane is a simple shear that transforms a unit cell attached to the plane into another unit cell equivalent by mirror symmetry or 180 degrees rotation. Thus, crystallographic models of twinning require the determination of the sho ...
INT UNION CRYSTALLOGRAPHY2021

A Local Law for Singular Values from Diophantine Equations

Marius Christopher Lemm

We introduce the N×NN\times N random matrices Xj,k=exp(2πiq=1d ωj,qkq)with {ωj,q}1jN1qd i.i.d. random variables,X_{j,k}=\exp\left(2\pi i \sum_{q=1}^d\ \omega_{j,q} k^q\right) \quad \text{with } \{\omega_{j,q}\}_{\substack{1\leq j\leq N\\ 1\leq q\leq d}} \text{ i.i.d. random variables}, and dd a fixed integer. We pr ...
2020

On the Complexity of Modulo-q Arguments and the Chevalley - Warning Theorem

Mika Tapani Göös

We study the search problem class PPA_q defined as a modulo-q analog of the well-known polynomial parity argument class PPA introduced by Papadimitriou (JCSS 1994). Our first result shows that this class can be characterized in terms of PPA_p for prime p. ...
Schloss Dagstuhl - Leibniz-Zentrum für Informatik2020

Proactive Synthesis of Recursive Tree-to-String Functions from Examples

Viktor Kuncak, Mikaël Mayer, Jad Hamza

Synthesis from examples enables non-expert users to generate programs by specifying examples of their behavior. A domain-specific form of such synthesis has been recently deployed in a widely used spreadsheet software product. In this paper we contribute t ...
2017

On infinite dimensional linear programming approach to stochastic control * *This research is partially supported by M. Kamgarpour’s European Union ERC Starting Grant, CONENE and by T. Summers’ the US National Science Foundation under grant CNS-1566127.

Maryam Kamgarpour, Tyler Summers

We consider the infinite dimensional linear programming (inf-LP) approach for solving stochastic control problems. The inf-LP corresponding to problems with uncountable state and input spaces is in general computationally intractable. By focusing on linear ...
2017

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.