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.
Modern programming languages have adopted the floating point type as a way to describe computations with real numbers. Thanks to the hardware support, such computations are efficient on modern architectures. However, rigorous reasoning about the resulting ...
This paper investigates a typical Speaker Diarization system regarding its robustness against initialization parameter variation and presents a method to reduce manual tuning of these values significantly. The behavior of an agglomerative hierarchical clus ...
We present a diffusion-based bias-compensated recursive least squares (RLS) algorithm for distributed estimation in ad-hoc adaptive sensor networks where nodes cooperate to estimate a common deterministic parameter vector. It is assumed that both the regre ...
In this paper we present an a posteriori error analysis for elliptic homogenization problems discretized by the finite element heterogeneous multiscale method. Unlike standard finite element methods, our discretization scheme relies on macro- and microfini ...
The search for robust features for face recognition in uncontrolled environments is an important topic of research. In particular, there is a high interest in Gabor-based features which have invariance properties to simple geometrical transformations. In t ...
Classical peaks over threshold analysis is widely used for statistical modeling of sample extremes, and can be supplemented by a model for the sizes of clusters of exceedances. Under mild conditions a compound Poisson process model allows the estimation of ...
We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NP-hard graph problems have resisted all attempts to prove inapproximability results. We show that they have no polynomial time approxima ...
Society for Industrial and Applied Mathematics2011
We examine whether equity volatility can explain the difference in syndicated corporate loan spreads paid by U.S. and European borrowers first documented by Carey and Nini (2007). We argue that OLS estimates of the association between equity volatility and ...
The goal of this paper is to propose a bio-inspired algorithm for decentralized dynamic access in cognitive radio systems. We study an improved social foraging swarm model that lets every node allocate its resources (power/bits) in the frequency regions wh ...
Reduced basis approximations for geometrically parametrized advection- diffusion equations are investigated. The parametric domains are assumed to be images of a reference domain through a piecewise polynomial map; this may lead to nonaffinely parametrized ...
