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.
Languages based on the theory of timed automata are a well established approach for modelling and analysing real-time systems, with many applications both in an industrial and academic context. Model checking for timed automata has been studied extensively ...
This paper proposes a dimension reduction technique for estimation in linear mixed models. Specifically, we show that in a linear mixed model, the maximum-likelihood (ML) problem can be rewritten as a substantially simpler optimization problem which presen ...
This paper examines the computational complexity certification of the fast gradient method for the solution of the dual of a parametric con- vex program. To this end, a lower iteration bound is derived such that for all parameters from a compact set a solu ...
In this paper, we provide the first linear programming formulations for the stable set problem in claw-free graphs, together with polynomial time separation routines for those formulations (they are not compact). We then exploit one of those extended formu ...
This thesis is a study of wave maps from a curved background to the standard two dimensional sphere S2. The target is always assumed to be embedded in R3 in the standard way. The do- main manifold (the "curved background") will be diffeomorphic to S2 × R, ...
Let r : S x S -> R+ be the jump rates of an irreducible random walk on a finite set S, reversible with respect to some probability measure m. For alpha > 1, let g : N -> R+ be given by g(0) = 0, g(1) = 1, g(k) = (k/k - 1)(alpha), k >= 2. Consider a zero ra ...
We present a contribution to the structure theory of locally compact groups. The emphasis is put on compactly generated locally compact groups which admit no infinite discrete quotient. It is shown that such a group possesses a characteristic cocompact sub ...
This experiment is the first test of the concept for a novel attitude determination sensor in freefall, that utilizes the Earth`s gravity gradient as a reference. Current sensors require multiple optical heads with access on all faces of a satellite that m ...
From algorithmic information theory, which connects the information content of a data set to the shortest computer program that can produce it, it is known that there are strong analogies between compression, knowledge, inference and prediction. The more w ...
The design and analysis of efficient approximation schemes are of fundamental importance in stochastic programming research. Bounding approximations are particularly popular for providing strict error bounds that can be made small by using partitioning tec ...
