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.
Devices and methods for dividing droplets are generally described. In some embodiments, an article may comprise a fluidic channel comprising an array of obstructions. In certain embodiments, the arrangement of obstructions in the array may affect the flow ...
We present an O(m^10/7) = O(m^1.43)-time algorithm for the maximum s-t flow and the minimum s-t cut problems in directed graphs with unit capacities. This is the first improvement over the sparse-graph case of the long-standing O(m min{m^1/2, n^2/3}) runni ...
Re-identification is usually defined as the problem of deciding whether a person currently in the field of view of a camera has been seen earlier either by that camera or another. However, a different version of the problem arises even when people are seen ...
Parallel shear flows have continuous symmetries of translation in the downstream and spanwise directions. As a consequence, flow states that differ in their spanwise or downstream location but are otherwise identical are dynamically equivalent. In the case ...
The nonaerated region may occupy a large portion of the skimming flow in steep, stepped spillways, particularly for relatively high unit flow rates. In spite of the numerous contributions on the hydraulic properties at both the inception point of air entra ...
We present a primal-dual algorithmic framework to obtain approximate solutions to a prototypical constrained convex optimization problem, and rigorously characterize how common structural assumptions affect the numerical efficiency. Our main analysis techn ...
Research on congestion and propagation in large urban city networks has been mainly based on microsimulations of link-level traffic dynamics. However, both the unpredictability of travel behaviors and high complexity of accurate physical modeling remain ch ...
Fluorescent Particle Tracking Velocimetry (FPTV) measurements of the pore-scale water flow through the pore space of a wet-snow sample are presented to demonstrate the applicability of this measurement technique for snow. For the experiments, ice-cooled wa ...
This work is an extension of PedCTM, an aggregate and transient cell transmission model for multidirectional pedestrian flows in which pedestrian characteristics are assumed to be homogeneous across the population considered. Critically, one fundamental di ...
In this work, we study the single machine scheduling problem with uncertain release times and processing times of jobs. We adopt a robust scheduling approach, in which the measure of robustness to be minimized for a given sequence of jobs is the worst-case ...
