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 Dolev-Reischuk bound says that any deterministic Byzantine consensus protocol has (at least) quadratic (in the number of processes) communication complexity in the worst case: given a system with n processes and at most f < n/3 failures, any solution t ...
Transfer functions are constantly used in both Seismology and Geotechnical Earthquake Engineering to relate seismic ground motion at different depths within strata. In the context of diffusive theory, they also appear in the expression of the imaginary par ...
We consider the problem of positive-semidefinite continuation: extending a partially specified covariance kernel from a subdomain Omega of a rectangular domain I x I to a covariance kernel on the entire domain I x I. For a broad class of domains Omega call ...
Cut and spectral sparsification of graphs have numerous applications, including e.g. speeding up algorithms for cuts and Laplacian solvers. These powerful notions have recently been extended to hypergraphs, which are much richer and may offer new applicati ...
We revise the proof of low-rate upper bounds on the reliability function of discrete memoryless channels for ordinary and list-decoding schemes, in particular Berlekamp and Blinovsky's zero-rate bound, as well as Blahut's bound for low rates. The available ...
We study p-adic families of cohomological automorphic forms for GL(2) over imaginary quadratic fields and prove that families interpolating a Zariski-dense set of classical cuspidal automorphic forms only occur under very restrictive conditions. We show ho ...
The popular isolation level multiversion Read Committed (RC) exchanges some of the strong guarantees of serializability for increased transaction throughput. Nevertheless, transaction workloads can sometimes be executed under RC while still guaranteeing se ...
Review of the monograph "Projekt ohne Form" by Holger Schurk on OMA’s competition entires from 1989, discussing Koolhaas’ approach to form in architecture. ...
Adjoint-based sensitivity analysis is routinely used today to assess efficiently the effect of open-loop control on the linear stability properties of unstable flows. Sensitivity maps identify regions where small-amplitude control is the most effective, i. ...
A method of manufacturing a fibre comprising a lined channel, using a draw apparatus, the method comprising: providing a preform, comprising a channel extending through the preform, to the draw apparatus; feeding a liner into the channel; heating a portion ...
