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.
The purpose of this paper is finding the essential attributes underlying the convexity theorems for momentum maps. It is shown that they are of a topological nature; more specifically, we show that convexity follows if the map is open onto its image and ha ...
Euclidean distance matrices (EDMs) are central players in many diverse fields including psychometrics, NMR spectroscopy, machine learning and sensor networks. However, they are not often exploited in signal processing. In this thesis, we analyze attributes ...
We prove a Hadwiger transversal-type result, characterizing convex position on a family of non-crossing convex bodies in the plane. This theorem suggests a definition for the order type of a family of convex bodies, generalizing the usual definition of ord ...
In the wide literature devoted to the cardiac structural mechanics, the strain energy proposed by Holzapfel and Ogden exhibits a number of interesting features: it has suitable mathematical properties and it is based on few material parameters that can, in ...
Procedures for first-order logic with equality are used in many modern theorem provers and solvers, yet procedure termination in case of interesting sub-classes of satisfiable formulas remains a challenging problem. We present an instantiation-based semi-d ...
The main goal of this paper is to propose a convergent finite volume method for a reaction–diffusion system with cross-diffusion. First, we sketch an existence proof for a class of cross-diffusion systems. Then the standard two-point finite volume fluxes a ...
We give compact extended formulations for the packing and partitioning orbitopes (with respect to the full symmetric group) described and analyzed in Kaibel and Pfetsch [Kaibel, V., M. E. Pfetsch. 2008. Packing and partitioning orbitopes. Math. Programming ...
We prove that a closed subgroup H of a locally compact group G is a set of p-uniqueness (1 < p < infinity) if and only if H is locally negligible. We also obtain the inverse projection theorem for sets of p-uniqueness. ...
For a given time or frequency spread, one can always find continuous- time signals, which achieve the Heisenberg uncertainty principle bound. This is known, however, not to be the case for discrete-time sequences; only widely spread sequences asymptoticall ...
A central problem in signal processing and communications is to design signals that are compact both in time and frequency. Heisenberg's uncertainty principle states that a given function cannot be arbitrarily compact both in time and frequency, defining a ...
