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 introduce and analyze a novel multilevel Monte Carlo (MLMC) estimator for the accurate approximation of central moments of system outputs affected by uncertainties. Central moments play a central role in many disciplines to characterize a r ...
We propose a framework that learns the graph structure underlying a set of smooth signals. Given a real m by n matrix X whose rows reside on the vertices of an unknown graph, we learn the edge weights w under the smoothness assumption that trace(X^TLX) is ...
We study the average of the product of the central values of two L-functions of modular forms f and g twisted by Dirichlet characters to a large prime modulus q. As our principal tools, we use spectral theory to develop bounds on averages of shifted convol ...
This thesis looks at efficient information processing for two network applications: content delivery with caching and collecting summary statistics in wireless sensor networks. Both applications are studied under the same paradigm: function computation ove ...
This paper deals with an approach to identify geometrical deviations of flexible parts from optical measurements. Each step of the approach defines a specific issue which we try to respond to. The problem of measurement uncertainties is solved using an ori ...
Clustering algorithms have evolved to handle more and more complex structures. However, measures allowing to qualify the quality of such partitions are rare and only specic to certain algorithms. In this work, we propose a new cluster validity measure (CVM ...
Function computation over Gaussian networks with orthogonal components is studied for arbitrarily correlated discrete memoryless sources. Two classes of functions are considered: 1) the arithmetic sum function and 2) the type function. The arithmetic sum f ...
Institute of Electrical and Electronics Engineers2014
As many whole genomes are sequenced, comparative genomics is moving from pairwise comparisons to multiway comparisons framed within a phylogenetic tree. A central problem in this process is the inference of data for internal nodes of the tree from data giv ...
Using three magnified Type Ia supernovae (SNe Ia) detected behind CLASH (Cluster Lensing and Supernovae with Hubble) clusters, we perform a first pilot study to see whether standardizable candles can be used to calibrate cluster mass maps created from stro ...
As shown by Michel and Ramakrishnan (2007) and later generalized by Feigon and Whitehouse (2008), there are "stable" formulas for the average central L-value of the Rankin-Selberg convolutions of some holomorphic forms of fixed even weight and large level ...