On the reverse isodiametric problem and Dvoretzky-Rogers-type volume bounds
Related publications (34)
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.
We propose an approximation framework for distributed target localization in sensor networks. We represent the unknown target positions on a location grid as a sparse vector, whose support encodes the multiple target locations. The location vector is linea ...
When implementing high-order surface impedance boundary conditions in collocation boundary element method (BEM) with constant or linear elements, difficulties arise due to the computation of the curvature of the conductors and of the tangential derivatives ...
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 this paper we propose a new structure for multiplication using optimal normal bases of type 2. The multiplier uses an efficient linear transformation to convert the normal basis representations of elements of Fqn to suitable polynomials of deg ...
In this paper, we consider mixture approaches that adaptively combine outputs of several parallel running adaptive algorithms. These parallel units can be considered as diversity branches that can be exploited to improve the overall performance. We study v ...
We give a convergence estimate for a Petrov-Galerkin Algebraic Multigrid method. In this method, the prolongations are defined using the concept of smoothed aggregation while the restrictions are simple aggregation operators. The analysis is carried out by ...
The rigidity function of a matrix is defined as the minimum number of its entries that need to be changed in order to reduce the rank of the matrix to below a given parameter. Proving a strong enough lower bound on the rigidity of a matrix implies a nontri ...
In this thesis we deal with three different but connected questions. Firstly (cf. Chapter 2) we make a systematic study of the generalized notions of convexity for sets. We study the notions of polyconvex, quasiconvex and rank one convex set. We remark tha ...
A new imager for 3D near-infrared imaging has been designed based on a single-photon avalanche diode (SPAD) imager with 128x128 pixels capable of performing time-resolved measurements with a resolution of 97ps. The imager linearity has been improved to mak ...