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 investigate the diameter of a natural abstraction of the 1-skeleton of polyhedra. Even if this abstraction is more general than other abstractions previously studied in the literature, known upper bounds on the diameter of polyhedra continue to hold her ...
This thesis deals with the numerical modeling and simulation of granular media with large populations of non-spherical particles. Granular media are highly pervasive in nature and play an important role in technology. They are present in fields as diverse ...
Convex polyhedra are important objects in various areas of mathematics and other disciplines. A fundamental result, known as Minkowski-Weyl theorem, states that every polyhedron admits two types of representations, either as the solution set to a finite sy ...
We investigate the diameter of a natural abstraction of the 1-skeleton of polyhedra. Although this abstraction is simpler than other abstractions that were previously studied in the literature, the best upper bounds on the diameter of polyhedra continue to ...
We study two decomposition problems in combinatorial geometry. The first part of the thesis deals with the decomposition of multiple coverings of the plane. We say that a planar set is cover-decomposable if there is a constant m such that any m-fold coveri ...
We present three different prepn. methods for CdSe colloidal nanoparticles that, when carried out into the Ostwald ripening regime, lead to the development of complex spectral patterns resulting from the overlap of several distinct components corresponding ...
This paper brings together two fundamental topics: polyhedral projection and parametric linear programming. First, it is shown that, given a parametric linear program (PLP), a polyhedron exists whose projection provides the solution to the PLP. Second, the ...
A new family of transition-metal-contg. phosphates ANa3M7(PO4)6, where A = K, Rb, Cs and M = Mn, Fe, Co, was synthesized via high-temp. (650-800°), solid state reactions. Sizable single crystals up to 1 cm (∼160 mg) were grown for structure and property ch ...
Robust state-feedback model predictive control (MPC) of discrete-time periodic affine systems is considered. States and inputs are subject to periodically time-dependent, hard, convex, polyhedral constraints. Disturbances are additive, bounded and subject ...
The vertex connectivity K of a graph is the smallest number of vertices whose deletion separates the graph or makes it trivial. We present the fastest known deterministic algorithm for finding the vertex connectivity and a corresponding separator. The time ...
