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.
The class of non-autonomous functionals under study is characterized by the fact that the energy density changes its ellipticity and growth properties according to the point; some regularity results are proved for related minimizers. These results are the ...
Since 2004 the European Commission's Joint Research Centre (JRC) has been analysing the online version of printed media in over twenty languages and has automatically recognised and compiled large amounts of named entities (persons and organisations) and t ...
PDF has become a de facto standard for exchanging electronic documents, for visualization as well as for printing. However, it has also become a common delivery channel for malware, and previous work has highlighted features that lead to security issues. I ...
We introduce OPTIK, a new practical design pattern for designing and implementing fast and scalable concurrent data structures. OPTIK relies on the commonly-used technique of version numbers for detecting conflicting concurrent operations. We show how to i ...
The calculation of the inverse scalelengths R/LT, R/Ln may depend on the choice of the radial variable, depending on the definition of the scalelength. The value of λT and λn, as defined in [O. Sauter {\it et al}, Phys. Plasmas {\bf ...
The aim of this short note is twofold. First, we give a sketch of the proof of a recent result proved by the authors in the paper [7] concerning existence and uniqueness of renormalized solutions of continuity equations with unbounded damping coefficient. ...
A priori, locking seems easy: To protect shared data from concurrent accesses, it is sufficient to lock before accessing the data and unlock after. Nevertheless, making locking efficient requires fine-tuning (a) the granularity of locks and (b) the locking ...
We present Approximate BDD Minimization (ABM) as a problem that has application in approximate computing. Given a BDD representation of a multi-output Boolean function, ABM asks whether there exists another function that has a smaller BDD representa ...
A semi-continuous formulation is introduced for finding bases that minimise the error in a specific output functional of a reduced-order model. The formulation is advantageous in that it can be used with arbitrary reference data and can be easily applied t ...
