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.
Let k be a global field of characteristic not 2, and let f is an element of k[X] be an irreducible polynomial. We show that a non-degenerate quadratic space has an isometry with minimal polynomial f if and only if such an isometry exists over all the compl ...
We consider the problem of ad~hoc microphone array calibration where the distance matrix consisted of all microphones pairwise distances have entries missing corresponding to distances greater than dmax. Furthermore, the known entries are noisy ...
In this paper we elucidate the rigid limit of N = 2 supergravity coupled to vector and hypermultiplets. In particular we show how the respective scalar field spaces reduce to their global counterparts. In the hypermultiplet sector we focus on the relation ...
Protection of one's intellectual property is a topic with important technological and legal facets. We provide mechanisms for establishing the ownership of a dataset consisting of multiple objects. The algorithms also preserve important properties of the d ...
Consider a proper cocompact CAT(0) space X. We give a complete algebraic characterisation of amenable groups of isometries of X. For amenable discrete subgroups, an even narrower description is derived, implying Q-linearity in the torsion-free case. We est ...
Choosing a distance preserving measure or metric is fun- damental to many signal processing algorithms, such as k- means, nearest neighbor searches, hashing, and compressive sensing. In virtually all these applications, the efficiency of the signal process ...
This project offers a rigorous introduction to the tools needed to construct a continuous stochastic process. Among other things, we give a very detailed proof of the Kolmogorov continuity criterion. We then construct a Brownian Motion following the formal ...
This paper addresses the application of missing data recovery via matrix completion for audio sensor networks. We propose a method based on Euclidean distance matrix completion for ad-hoc microphone array location calibration. This method can calibrate a f ...
Representations of solutions of equations describing the diffusion and quantum dynamics of particles in a Riemannian manifold are discussed under the assumption that the mass of particles is anisotropic and depends on both time and position. These equation ...
We present a theoretical analysis of the CORSING (COmpRessed SolvING) method for the numerical approximation of partial differential equations based on compressed sensing. In particular, we show that the best s-term approximation of the weak solution of a ...
