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.
In this work we investigate the advantages of multiscale methods in Petrov-Galerkin (PG) formulation in a general framework. The framework is based on a localized orthogonal decomposition of a high dimensional solution space into a low dimensional multisca ...
We consider the problem of solving a distributed optimization problem using a distributed computing platform, where the communication in the network is limited: each node can only communicate with its neighbours and the channel has a limited data-rate. A c ...
Like other data sensing problems, in unlabeled sensing, the target is to solve the equation y = Φx by finding vector x given a set of sample values in vector y as well as the matrix Φ. However, the main challenge in unlabeled sensing is that the correct or ...
We present a description of transition rate matrices of models for Stochastic Automata Networks (SAN) in their representation as operators in Tensor Train (TT) format. The collection contains models from real-life applications both taken from references di ...
We propose a recursive algorithm for estimating time-varying signals from a few linear measurements. The signals are assumed sparse, with unknown support, and are described by a dynamical model. In each iteration, the algorithm solves an ℓ1-ℓ1 minimization ...
This work is concerned with approximating the smallest eigenvalue of a parameter-dependent Hermitian matrix A(μ) for many parameter values μ ∈ RP. The design of reliable and efficient algorithms for addressing this task is of importance in a variety of app ...
Tractography is a class of algorithms aiming at in vivo mapping the major neuronal pathways in the white matter from diffusion MRI data. These techniques offer a powerful tool to noninvasively investigate at the macroscopic scale the architecture of the ne ...
Institute of Electrical and Electronics Engineers2015
This work focuses on Green's functions (GFs) of planar multilayered structures that may include an arbitrary number of conductive sheets. The spectral-domain GFs are derived through an automatized strategy based on the propagator matrix technique, while th ...
Institute of Electrical and Electronics Engineers2015
A fundamental problem in comparative genomics is to compute the distance between two genomes. For two genomes without duplicate genes, we can easily compute a variety of distance measures in linear time, but the problem is NP-hard under most models when ge ...
This thesis is concerned with a number of novel uses of spatial coupling, applied to a class of probabilistic graphical models. These models include error correcting codes, random constraint satisfaction problems (CSPs) and statistical physics models calle ...