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.
Logic resynthesis is the problem of finding a dependency function to re-express a given Boolean function in terms of a given set of divisor functions. In this paper, we study logic resynthesis of majority-based circuits, which is motivated by the increasin ...
We find an optimal upper bound on the volume of the John ellipsoid of a k-dimensional section of the n-dimensional cube, and an optimal lower bound on the volume of the Lowner ellipsoid of a projection of the n-dimensional cross-polytope onto a k-dimension ...
We have carried out a systematic investigation of the critical activation parameters (i.e., final temperature (673-1273 K), atmosphere (He vs. O-2/He), and final isothermal hold (1 min-15 h) on the generation of "alpha-sites", responsible for the direct N2 ...
Given a level set E of an arbitrary multiplicative function f, we establish, by building on the fundamental work of Frantzikinakis and Host [14, 15], a structure theorem that gives a decomposition of 1E into an almost periodic and a pseudo-random part ...
HycycleS was a cooperation of nine European partners and further non-European partners and aimed at the qualification and enhancement of materials and components for key steps of solar and nuclear powered thermochemical cycles for hydrogen generation from ...
The presence of MgB12H12 has often been considered as the major obstacle for the reversible hydrogen storage in Mg(BH4)(2). This communication provides evidence that the MgB12H12 phase (or B12H12 monomer) does not exist in the decomposition products ...
Let d be a fixed positive integer and let epsilon > 0. It is shown that for every sufficiently large n >= n(0)( d, e), the d-dimensional unit cube can be decomposed into exactly n smaller cubes such that the ratio of the side length of the largest cube to ...
We propose an algorithm for solving the maximum weighted stable set problem on claw-free graphs that runs in O(n^3)-time, drastically improving the previous best known complexity bound. This algorithm is based on a novel decomposition theorem for claw-free ...
In this work a numerical strategy to address the solution of the blood flow in one-dimensional arterial networks through a topology-based decomposition is presented. Such decomposition results in the local analysis of the blood flow in simple arterial segm ...
This study aims at an investigation of the impurity gases emitted during the decomposition of borohydrides. For this we have set up a quantitative gas analysis based on a combination of FTIR spectroscopy and gravimetry. We show that the emission of various ...
