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 street-network efficiency of tens of British cities in relation to transport fuel consumption and CO2 emissions are analyzed. The results show a strong linear positive correlation between length entropy and average street length, and a negative correla ...
A k-ary semi-algebraic relation E on R-d is a subset of R-kd, the set of k-tuples of points in R-d, which is determined by a finite number of polynomial inequalities in kd real variables. The description complexity of such a relation is at most t if d, k < ...
Supplementary cementitious materials (SCM) are known to reduce or even stop expansion due to alkali silica reaction (ASR) in concretes with reactive aggregates. Studies indicate that the main reason for this is the decrease in alkalinity of the pore soluti ...
The high failure rate expected for future supercomputers requires the design of new fault tolerant solutions. Most checkpointing protocols are designed to work with any message-passing application but suffer from scalability issues at extreme scale. We tak ...
The Lighthouse Project proposes a house. Named a House it had to address inhabitation: for whom was defined by each student. Additionally the Lighthouse had to include a public function. Light was considered as an attractor and conductor of flows in the ur ...
A k-ary semi-algebraic relation E on R^d is a subset of R^{kd}, the set of k-tuples of points in R^d, which is determined by a finite number of polynomial equations and inequalities in kd real variables. The description complexity of such a relation is at ...
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints with a rich set of operations. A key challenge is to define such classes of ...
Decision procedures are widely used in software development and verification. The goal of this dissertation is to increase the scope of properties that can be verified using decision procedures. To achieve this goal, we identify three improvements over the ...
The relation between the near–field and far–field properties of plasmonic nanostructures that exhibit Fano resonances is investigated in detail. We show that specific features visible in the asymmetric lineshape far–field response of such structures origin ...
The success of 3DTV, as one of the emerging multimedia formats, will largely depend on the quality of experience it provides to the viewer in relation to traditional media. Therefore reliable methods for quality assessment are crucial in order to optimize ...
