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 study the problem of navigating through a database of similar objects using comparisons under heterogeneous demand, a problem strongly related to small-world network design. We show that, under heterogeneous demand, the small-world network design proble ...
We prove trace identities for commutators of operators, which are used to derive sum rules and sharp universal bounds for the eigenvalues of periodic Schrodinger operators and Schrodinger operators on immersed manifolds. In particular, we prove bounds on t ...
We consider backward stochastic differential equations (BSDEs) with a particular quadratic generator and study the behaviour of their solutions when the probability measure is changed, the filtration is shrunk, or the underlying probability space is transf ...
A major challenge in sparsity pattern estimation is that small modes are difficult to detect in the presence of noise. This problem is alleviated if one can observe samples from multiple realizations of the nonzero values for the same sparsity pattern. We ...
We develop several results on hitting probabilities of random fields which highlight the role of the dimension of the parameter space. This yields upper and lower bounds in terms of Hausdorff measure and Bessel-Riesz capacity, respectively. We apply these ...
We present ABC, a software tool for automatically computing symbolic upper bounds on the number of iterations of nested program loops. The system combines static analysis of programs with symbolic summation techniques to derive loop invariant relations bet ...
This article describes a bounding approximation scheme for convex multistage stochastic programs (MSP) that constrain the conditional expectation of some decision-dependent random variables. Expected value constraints of this type are useful for modelling ...
Dynamic stochastic optimization problems with a large (possibly infinite) number of decision stages and high-dimensional state vectors are inherently difficult to solve. In fact, scenario tree-based algorithms are unsuitable for problems with many stages, ...
We consider multiple access communication on a binary input additive white Gaussian noise channel using randomly spread code division. For a general class of symmetric distributions for spreading coefficients, in the limit of a large number of users, we pr ...
This Master thesis presents a complete cycle in the use of models for the study of a complex pathway like the TOR pathway. Previous models were reproduced for the phosphatase part of the pathway, and the assumptions used and the results they provided were ...
