Harmonic symmetrization of convex sets and of Finsler structures, with applications to Hilbert geometry
Graph Chatbot
Chat with Graph Search
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.
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 ...
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 ...
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. ...
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 ...
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 ...
