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.
A standard question arising in optimal transport theory is whether the Monge problem and the Kantorovich relaxation have the same infimum; the positive answer means that we can pass to the relaxed problem without loss of information. In the classical case ...
This paper measures the performance in terms of costs of Swiss drinking water utilities accounting for environmental factors. We estimate a translog stochastic variable cost frontier using two different techniques on an unbalanced panel of 141 water distri ...
We present a platform that combines microarrays and microfluidic techniques to measure four protein biomarkers in 1024 serum samples for a total of 4096 assays per device. Detection is based on a surface fluorescence sandwich immunoassay with a limit of de ...
We consider the problem of building a binary decision tree, to locate an object within a set by way of the least number of membership queries. This problem is equivalent to the “20 questions game” of information theory and is closely related to lossless so ...
The goal of multi-objective query optimization (MOQO) is to find query plans that realize a good compromise between conicting objectives such as minimizing execution time and minimizing monetary fees in a Cloud scenario. A previously proposed exhaustive MO ...
In this paper we deal with the critical node problem (CNP), i.e., the problem of searching for a given number K of nodes in a graph G, whose removal minimizes the (weighted or unweighted) number of connections between pairs of nodes in the residual graph. ...
Let G=(V,E)G=(V,E) be a graph in which every vertex v∈Vv∈V has a weight w(v)⩾0w(v)⩾0 and a cost c(v)⩾0c(v)⩾0. Let SGSG be the family of all maximum-weight stable sets in G . For any integer d⩾0d⩾0, a minimum d-transversal in the graph G with respect to SGS ...
Organic electronic materials remarkably illustrate the importance of the "weak" dispersion interactions that are neglected in the most cost-efficient electronic structure approaches. This work introduces a fast atom-pairwise dispersion correction, dDMC tha ...
Performance and total cost of ownership (TCO) are key optimization metrics in large-scale data centers. According to these metrics, data centers designed with conventional server processors are inefficient. Recently introduced processors based on low-power ...
Institute of Electrical and Electronics Engineers2012
One of the classic results in scheduling theory is the 2-approximation algorithm by Lenstra, Shmoys, and Tardos for the problem of scheduling jobs to minimize makespan on unrelated machines; i.e., job j requires time p(ij) if processed on machine i. More t ...
