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.
In this paper we consider two aspects of the inverse problem of how to construct merge trees realizing a given barcode. Much of our investigation exploits a recently discovered connection between the symmetric group and barcodes in general position, based ...
We consider integer programming problems in standard form max{c(T)x : Ax = b, x >= 0, x is an element of Z(n)} where A is an element of Z(mxn), b is an element of Z(m), and c is an element of Z(n). We show that such an integer program can be solved in time ...
We consider integer programming problems in standard form max{c(T)x : Ax = b; x >= 0, x is an element of Z(n)} where A is an element of Z(mxn), b is an element of Z(m) and c is an element of Z(n). We show that such an integer program can be solved in time ...
All H-infinity controllers of a SISO LTI system are parameterized thanks to the relation between Bounded Real Lemma and Positive Real Lemma and a new concept of strict positive realness of two transfer functions with the same Lyapunov matrix in the matrix ...
Institute of Electrical and Electronics Engineers2010
We report here the photophysical properties of a water-soluble conjugated polythiophene with cationic side-chains. When dissolved in aqueous buffer solution (PBS, phosphate buffered saline), there is ordering of the polymer chains due to the presence of th ...
We study the basic problem of assigning memoryless workers to tasks with dynamically changing demands. Given a set of w workers and a multiset T ⊆ [t] of |T| = w tasks, a memoryless worker-task assignment function is any function ϕ that assigns the workers ...
Schloss Dagstuhl -- Leibniz-Zentrum fur Informatik2022
We establish an explicit upper bound for the Euclidean minimum of a number field which depends, in a precise manner, only on its discriminant and the number of real and complex embeddings. Such bounds were shown to exist by Davenport and Swinnerton-Dyer ([ ...
The main goal of this paper is to propose a convergent finite volume method for a reaction–diffusion system with cross-diffusion. First, we sketch an existence proof for a class of cross-diffusion systems. Then the standard two-point finite volume fluxes a ...
