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.
Unresolved indirect branch instructions are a major obstacle for statically reconstructing a control flow graph (CFG) from machine code. If static analysis cannot compute a precise set of possible targets for a branch, the necessary conservative over-appro ...
In Control System Theory, the study of continuous-time, finite dimensional, underdetermined systems of ordinary differential equations is an important topic. Classification of systems in different categories is a natural initial step to the analysis of a g ...
The intersection graph of a collection C of sets is the graph on the vertex set C, in which C-1 . C-2 is an element of C are joined by an edge if and only if C-1 boolean AND C-2 not equal empty set. Erdos conjectured that the chromatic number of triangle-f ...
Conducting a thorough performance evaluation of an STM is very time consuming. Depressingly, even with all this effort, and even with the same application, it can still be hard to predict the performance if the number of underlying threads on which the app ...
Due to high scaling order of MP2 and CCSD(T) methods, it is either difficult or at times even impossible to treat even moderately sized molecular systems with elaborate basis sets such as aug-cc-pVXZ (X = D, T, Q). In the present work, several structures o ...
In the recent years, researchers have investigated several methods of facial expression analysis. Their interest has been to apply their algorithms to sets of images labelled by a restrained number of experts. In order to deal with the generalizability of ...
We consider the map T-alpha,T-beta(x) := beta x + alpha mod 1, which admits a unique probability measure of maximal entropy. For x is an element of [0, 1], we show that the orbit of x is mu(alpha,beta)-normal for almost all (alpha, beta) is an element of [ ...
From several decades, non-adjacent form (NAF) representations for integers have been extensively studied as an alternative to the usual binary number system where digits are in {0,1}. In cryptography, the non-adjacent digit set (NADS) {-1,0,1} is used for ...
Semantic document annotation may be useful for many tasks. In particular, in the framework of the MDM project(http://www.issco.unige.ch/projects/im2/mdm/), topical annotation -- i.e. the annotation of document segments with tags identifying the topics disc ...
We consider a network of N coupled limit cycle oscillators, each having a set of control parameters Λ_k, k = 1, . . . , N, that controls the frequency and the geometry of the limit cycle. We implement a self-adaptive mechanism that drives the local systems ...