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.
This is a correction to [BP 11] E. Bayer-Fluckiger, R. Parimala, Galois algebras, Hasse principle and induction-restriction methods, Documenta Math. 16 (2011), 677-707. ...
We analyze the renormalon diagram of gauge theories on . In particular, we perform exact one loop calculations for the vacuum polarization in QCD with adjoint matter and observe that all infrared logarithms, as functions of the external momentum, cancel be ...
The invention relates to a vehicle which includes at least four wheels and a base. Said wheels are attached in pairs at the base via connections and form a bogie consisting of a pair of wheels. Said bogies are rotatably hinged onto the base such that the p ...
As constructing concept maps from scratch can be time consuming, this study explores critiquing given concept maps with deliberate errors as an alternative. A form of concept map that distinguishes between different levels, called Knowledge Integration Map ...
A drawing of a graph is x-monotone if every edge intersects every vertical line at most once and every vertical line contains at most one vertex. Pach and Toth showed that if a graph has an x-monotone drawing in which every pair of edges crosses an even nu ...
How about fastening a knot? not with ropes... but with timber panels. Timber Fabric
Structures (TFS) originate from such an inspiration. An architectural reinterpretation
of fabric techniques (mainly braiding) using building scale timber panels to design ...
A well-studied special case of bin packing is the 3-partition problem, where n items of size > 1/4 have to be packed in a minimum number of bins of capacity one. The famous Karmarkar-Karp algorithm transforms a fractional solution of a suitable LP relaxati ...
This paper completes a proof of the Dirac reduction theorem by involutive tangent subbundles. As a consequence, Dirac reduction by a proper Lie group action having one isotropy type is carried out. The main technical tool in the proof is the notion of part ...
In this paper, we consider decoding of loss tolerant data encoded by network coding and transmitted over error-prone networks. Intermediate network nodes typically perform the random linear network coding in a Galois field and a Gaussian elimination is use ...
In this paper we construct a deterministic polyno- mial time algorithm for the problem where a set of users is interested in gaining access to a common file, but where each has only partial knowledge of the file. We further assume the existence of another ...
