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.
We consider the extinction events of Galton-Watson processes with countably infinitely many types. In particular, we construct truncated and augmented Galton-Watson processes with finite but increasing sets of types. A pathwise approach is then used to sho ...
We consider sets L = {l(1),..., l(n)} of n labeled lines in general position in R-3, and study the order types of point sets {p(1),..., p(n)} that stem from the intersections of the lines in L with (directed) planes Pi, not parallel to any line of L, that ...
We construct a finitely presented, infinite, simple group that acts by homeomorphisms on the circle, but does not admit a non-trivial action by C1-diffeomorphisms on the circle. This is the first such example. The group emerges as a group of piecewise proj ...
Private Set Intersection (PSI) allows two parties, the sender and the receiver, to compute the intersection of their private sets without revealing extra information to each other. We are interested in the unbalanced PSI setting, where (1) the receiver's s ...
Crowdsourcing has been widely established as a means to enable human computation at large-scale, in particular for tasks that require manual labelling of large sets of data items. Answers obtained from heterogeneous crowd workers are aggregated to obtain a ...
We introduce the first passage set (FPS) of constant level -a of the two-dimensional continuum Gaussian free field (GFF) on finitely connected domains. Informally, it is the set of points in the domain that can be connected to the boundary by a path on whi ...
We report a search for X(3872) and X(3915) in B+ ->chi(c1)pi K-0(+) decays. We set an upper limit of B(B+ -> X(3872)K+) x B(X(3872) -> chi(c1)pi(0)) < 8.1 x 10(-6) and B(B+ -> X(3915)K+) x B(X(3915) -> chi(c1)pi(0)) < 3.8 x 10(-5) at 90% confidence level. ...
In this paper we show that every set A ⊂ ℕ with positive density contains B + C for some pair B, C of infinite subsets of ℕ , settling a conjecture of Erdős. The proof features two different decompositions of an arbitrary bounded sequence into a structured ...
The need for predictive capabilities greater than 95% with very limited false alarms are demanding requirements for reliable disruption prediction systems in tokamaks such as JET or, in the near future, ITER. The prediction of an upcoming disruption must b ...
This article presents a control algorithm framework with which a bipedal robot can perform a variety of gaits by only modifying a small set of control parameters. The controller drives a number of variables, called non-emergent variables, to their desired ...
