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.
We present the results of an experimental investigation on the crystallography of the dimpled patterns obtained through wrinkling of a curved elastic system. Our macroscopic samples comprise a thin hemispherical shell bound to an equally curved compliant s ...
Progressive algorithms are algorithms that, on the way to computing a complete solution to the problem at hand, output intermediate solutions that approximate the complete solution increasingly well. We present a framework for analyzing such algorithms, an ...
The city is a kind of complex system being capable of auto-organization of its programs and adapts a principle of economy in its form generating process. A new concept of dynamic centre in urban system, called "the programmatic moving centre", can be used ...
One of the main factors of crowding is the spacing between target and flankers. The closer the flankers are to the target, the stronger is crowding. Recently, it was proposed that crowding strength is determined by the distance between target and flanker c ...
The spacing between target and flankers is one of the main factors of crowding. The closer the flankers are to the target, the stronger is crowding. Recently, it was proposed that crowding strength is determined by the distance between target and flanker c ...
We study the problem of constructing epsilon-coresets for the (k, z)-clustering problem in a doubling metric M(X, d). An epsilon-coreset is a weighted subset S subset of X with weight function w : S -> R->= 0, such that for any k-subset C is an element of ...
The geometric median, an instrumental component of the secure machine learning toolbox, is known to be effective when robustly aggregating models (or gradients), gathered from potentially malicious (or strategic) users. What is less known is the extent to ...
As many whole genomes are sequenced, comparative genomics is moving from pairwise comparisons to multiway comparisons framed within a phylogenetic tree. A central problem in this process is the inference of data for internal nodes of the tree from data giv ...
Dynamic mesh adaptation on unstructured grids, by localised refinement and derefinement, is a very efficient tool for enhancing solution accuracy and optimise computational time. One of the major drawbacks however resides in the projection of the new nodes ...
The objective of this paper is to present two types of results on Minkowski sums of convex polytopes. The first is about a special class of polytopes we call perfectly centered and the combinatorial properties of the Minkowski sum with their own dual. In p ...
