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.
Conjugation spaces are topological spaces equipped with an involution such that their fixed points have the same mod 2 cohomology (as a graded vector space, a ring and even an unstable algebra) but with all degrees divided by two, generalizing the classica ...
We consider integer programming problems in standard form max{c(T)x : Ax = b, x >= 0, x is an element of Z(n)} where A is an element of Z(mxn), b is an element of Z(m), and c is an element of Z(n). We show that such an integer program can be solved in time ...
We find an optimal upper bound on the volume of the John ellipsoid of a k-dimensional section of the n-dimensional cube, and an optimal lower bound on the volume of the Lowner ellipsoid of a projection of the n-dimensional cross-polytope onto a k-dimension ...
Max-stable processes are central models for spatial extremes. In this paper, we focus on some space-time max-stable models introduced in Embrechts et al. (2016). The processes considered induce discrete-time Markov chains taking values in the space of cont ...
We consider integer programming problems in standard form max{c(T)x : Ax = b; x >= 0, x is an element of Z(n)} where A is an element of Z(mxn), b is an element of Z(m) and c is an element of Z(n). We show that such an integer program can be solved in time ...
Let R be a finite set of terminals in a convex metric space (M, d). We give approximation algorithms for problems of finding a minimum size set S subset of M of additional points such that the unit-disc graph G[R boolean OR S] of R boolean OR S satisfies s ...
The goal of scenario reduction is to approximate a given discrete distribution with another discrete distribution that has fewer atoms. We distinguish continuous scenario reduction, where the new atoms may be chosen freely, and discrete scenario reduction, ...
The invention is notably directed to a method for determining positions {pi}i=1,..., N of transducers {Ai}i=1,..., N of an apparatus. The transducers are assumed to be configured for receiving wave signals from and/or transmitting wave signals to one or mo ...
We consider radially symmetric, energy critical wave maps from (1 + 2)-dimensional Minkowski space into the unit sphere Sm, m≥1, and prove global regularity and scattering for classical smooth data of finite energy. In addition, we establish a ...
Graph sparsification has been studied extensively over the past two decades, culminating in spectral sparsifiers of optimal size (up to constant factors). Spectral hypergraph sparsification is a natural analogue of this problem, for which optimal bounds on ...