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.
We present the general notion of Borel fields of metric spaces and show some properties of such fields. Then we make the study specific to the Borel fields of proper CAT(0) spaces and we show that the standard tools we need behave in a Borel way. We also i ...
It is known that a Green's function-type condition may be used to derive rates for approximation by radial basis functions (RBFs). In this paper, we introduce a method for obtaining rates for approximation by functions which can be convolved with a finite ...
By a polygonization of a finite point set S in the plane we understand a simple polygon having S as the set of its vertices. Let B and R be sets of blue and red points, respectively, in the plane such that is in general position, and the convex hull of B c ...
As Avez showed (in 1970), the fundamental group of a compact Riemannian manifold of nonpositive sectional curvature has exponential growth if and only if it is not flat. After several generalizations from Gromov, Zimmer, Anderson, Burger and Shroeder, the ...
Let C be a family of n convex bodies in the plane, which can be decomposed into k subfamilies of pairwise disjoint sets. It is shown that the number of tangencies between the members of C is at most O(kn), and that this bound cannot be improved. If we only ...
We describe a decision procedure for a logic that supports 1) finite collections of elements (sets or multisets), 2) the cardinality operator, 3) a total order relation on elements, and 4) min and max operators on entire collections. Among the applications ...
This work is dedicated to the study of Borel equivalence relations acting on Borel fields of CAT(0) metric spaces over a standard probability space. In this new framework we get similar results to some theorems proved recently by S. Adams-W. Ballmann or N. ...
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints with a rich set of operations. A key challenge is to define such classes of ...
Let n >= 4 be even. It is shown that every set S of n points in the plane can be connected by a (possibly self-intersecting) spanning tour (Hamiltonian cycle) consisting of n straight-line edges such that the angle between any two consecutive edges is at m ...
Motivated by the problem of deciding verification conditions for the verification of functional programs, we present new decision procedures for automated reasoning about functional lists. We first show how to decide in NP the satisfiability problem for lo ...
