Harmonic symmetrization of convex sets and of Finsler structures, with applications to Hilbert geometry
Graph Chatbot
Chattez avec Graph Search
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.
Summary: We present a method based on an optimal control technique for numerical computations of geodesic paths between two fixed points of a Riemannian manifold under the assumption of existence. In this method, the control variable is the tangent vector ...
This paper presents an application of the general sample-to-object approach to the problem of invariant image classification. The approach results in defining new SVM kernels based on tangent vectors that take into account prior information on known invari ...
This paper presents an application of the general sample-to-object approach to the problem of invariant image classification. The approach results in defining new SVM kernels based on tangent vectors that take into account prior information on known invari ...
This is the text of an introductory lecture I made at the Séminaire Borel 2003 (IIIème Cycle Romand de Mathématiques). The general theme of that seminaire was Tangent Spaces of Metric Spaces. ...
We define ``random trip", a generic mobility model for independent mobiles that contains as special cases: the random waypoint on convex or non convex domains, random walk with reflection or wrapping, city section, space graph and other models. We use Palm ...
Given a set P of n points in the plane, we want to find a simple, not necessarily convex, pentagon Q with vertices in P of minimum area. We present an algorithm for solving this problem in time O(nT(n)) and space O(n) , where T(n) is the number of empty tr ...
