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.
In this paper, we investigate the applicability of backtrack technique for solving the vertex enumeration problem and the face enumeration problem for a convex polyhedron given by a system of linear inequalities. We show that there is a linear-time backtra ...
Although many three-dimensional (3D) medical imaging visualization methods exist, 3D volume slicing remains the most commonly used technique for visualizing medical data from modalities such as CT, MRI, and PET. We propose to extend the possibilities of ob ...
A new criterion for the appearance of hot tears in metallic alloys is proposed. Based upon a mass balance performed over the liquid and solid phases, it accounts for the tensile deformation of the solid skeleton perpendicular to the growing dendrites and f ...
The structure of a crystal of natural melilite from San Venanzo, Umbria (Italy) of the general formula X(2)T1(T2)(2)O-7, where X = Ca0.945Sr0.005Na0.04K0.01, T1 = Mg0.92Al0.08 and T2 = Si0.99Al0.01, has been solved and refined as an incommensurate structur ...
The quest to determine accurately the stability of tearing and resistive interchange modes in two-dimensional toroidal geometry led to the development of the PEST-3 code, which is based on solving the singular, zero-frequency ideal MHD equation in the plas ...
The poser scheduling problem has been shown to be NP-complete in the general case but in P for a special case by Chang and Edmonds. In this paper, we extend the class of polynomially solvable cases and give some polyhedral characterizations. ...
Every convex polyhedron in the Euclidean space Rd admits both H-representation and V-representation. When working with convex polyhedra, in particular large-scale ones in high dimensions, it is useful to have a canonical representation that is minimal a ...
We deal with non-rank facets of the stable set polytope of claw-free graphs. We extend results of Gilles and Trotter (7) by (i) showing that for any nonnegative integer a there exists a circulant graph whose stable set polytope has a facet-inducing inequal ...
In this paper, we investigate the applicability of backtrack technique to solve the vertex enumeration problem and the face enumeration problem for a convex polyhedron given by a system of linear inequalities. We show that there is a linear-time backtrack ...
