Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
In a seminal paper published in 1946, Erd ̋os initiated the investigation of the distribution of distances generated by point sets in metric spaces. In spite of some spectacular par- tial successes and persistent attacks by generations of mathe- maticians, ...
Energy efficiency is a major design issue in the context of Wireless Sensor Networks (WSN). If the acquired data is to be sent to a far-away base station, collaborative beamforming performed by the sensors may help to distribute the communication load amon ...
Many natural and man-made signals can be described as having a few degrees of freedom relative to their size due to natural parameterizations or constraints; examples include bandlimited signals, collections of signals observed from multiple viewpoints in ...
Let d(1) < d(2) < ... denote the set of all distances between two vertices of a convex n-gon. We show that the number of pairs of vertices at distance d(2) from one another is at most n + O(1). (C) 2013 Elsevier B.V. All rights reserved. ...
The evolution of flux distribution in MgB2 single crystals during their remagnetization was imaged with magneto-optical technique. Meissner holes, formed as the areas where the annihilation of vortices and antivortices takes place, were found at the bounda ...
Erd\H{o}s conjectured in 1946 that every n-point set P in convex position in the plane contains a point that determines at least floor(n/2) distinct distances to the other points of P. The best known lower bound due to Dumitrescu (2006) is 13n/36 - O(1). I ...
We consider the estimation of the acoustic source position in a known room from recordings by a microphone array. We propose an algorithm that does not require the room to be convex, nor a line-of-sight path between the microphone array and the source to b ...
Recovery of sparse signals from linear, dimensionality reducing measurements broadly fall under two well-known formulations, named the synthesis and the analysis a ́ la Elad et al. Recently, Chandrasekaran et al. introduced a new algorithmic sparse recover ...
The polynomial Hirsch conjecture states that the vertex-edge diameter of a d-dimensional polyhedron with n facets is bounded by a polynomial in d and n. For the special case where the polyhedron is defined as the set of points satisfying a system Ax ≤ b of ...
