Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
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 th ...
Most distributed systems are large-scale and dynamic. Communication has thus become a critical issue and the shared memory, which is a reliable paradigm of communication, allow distributed nodes to exchange information through read and write operations. In ...
We study the problem of navigating/searching through a database of objects with potentially different popularities using a membership oracle. The membership oracle, given a subset of objects A, and a target object t, determines whether A contains t ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011
In the highway problem, we are given an n-edge line graph (the highway), and a set of paths (the drivers), each one with its own budget. For a given assignment of edge weights (the tolls), the highway owner collects from each driver the weight of the assoc ...
We study the time complexity for deterministic broadcasting algorithms in mobile radio networks. The broadcast operation consists of a source node successfully communicating its message to every other node. In multi-hop radio networks such as MANETs, the m ...
This paper discusses the use of ferns (a set of binary features) for face detection. The binary feature used here is the sign of pixel intensity difference. Ferns were first introduced for keypoint recognition and showed good performance, and improving the ...
Many data-driven social and Web applications involve collaboration and coordination. The vision of Declarative Data-Driven Coordination (D3C), proposed in Kot et al. [2010], is to support coordination in the spirit of data management: to make it data-centr ...
Nanomaterials have been increasingly employed as drug(s)-incorporated vectors for drug delivery due to their potential of maximizing therapeutic efficacy while minimizing systemic side effects. However, there have been two main challenges for these vectors ...
Decellularized tissues composed of extracellular matrix (ECM) and used as biologic scaffolds, have been shown to be useful for the repair of a variety of tissues. The clinical utility of such scaffolds for the tissue engineering of Nucleus Pulposus (NP) mi ...
Solving a convex optimization problem within an a priori certified period of time is a challenging problem. This paper discusses the certification of Nesterov’s fast gradient method for problems with a strictly quadratic objective and a feasible set given ...
