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 thesis is about objects that can undo their state changes. Based on an earlier work on data structure persistence, we propose generating undo methods for classes from annotated classes automatically. As opposed to ephemeral data structures, persistent ...
We present a probabilistic architecture for solving generically the problem of extracting the task constraints through a Programming by Demonstration (PbD) framework and for generalizing the acquired knowledge to various situations. We propose an approach ...
Programming interactive systems by means of the observer pattern is hard and error-prone yet is still the implementation standard in many production environments. We present an approach to gradually deprecate observers in favor of reactive programming abst ...
Automated synthesis of program fragments from specifications can make programs easier to write and easier to reason about. To integrate synthesis into programming languages, software synthesis algorithms should behave in a predictable way: they should succ ...
We prove a general subconvex bound in the level aspect for Rankin–Selberg L-functions associated with two primitive holomorphic or Maass cusp forms over Q. We use this bound to establish the equidistribution of incomplete Galois orbits of Heegner points on ...
A Dirichlet problem for orthogonal Hessians in two dimensions is explicitly solved, by characterizing all piecewise C-2 functions u Omega subset of R-2 -> R with orthogonal Hessian in terms of a property named "second order angle condition" as in (1 1) ...
Consider the problem of sampling signals which are not bandlimited, but still have a finite number of degrees of freedom per unit of time, such as, for example, piecewise polynomial or piecewise sinusoidal signals, and call the number of degrees of freedom ...
For processing compiled code, model checkers require accurate model extraction from binaries. We present our fully configurable binary analysis platform Jakstab, which resolves indirect branches by multiple rounds of disassembly interleaved with dataflow a ...
Robots are both fascinating objects for the general public and devices whose conception, understanding and pro- gramming involve many fields. This unique combination makes them an ideal tool for introducing science and technology to children. This paper pr ...
Any finite, separately convex, positively homogeneous function on R2 is convex. This was first established by the first author ["Direct methods in calculus of variations", Springer-Verlag (1989)]. Here we give a new and concise proof of this re ...