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.
Precoloring extension problems are known to be NP-complete in several classes of graphs. Here, we consider precolorings of cographs with not only stable sets but also with cliques. We give polynomial time algorithms to extend such a precoloring in an optim ...
For nonlinear sigma models in the unitary symmetry class, the nonlinear target space can be parameterized with cubic polynomials. This choice of coordinates has been known previously as the Dyson-Maleev parameterization for spin systems, and we show that i ...
D.J. Bernstein has proposed a circuit-based implementation of the matrix step of the number field sieve factorization algorithm (see "Circuits for integer factorization: a proposal", http://cr.yp.to/papers.html#nfscircuit, 2001). These circuits offer an as ...
The medical image registration problem can be formulated as a nonlinear programming problem. To identify appropriate algorithms to solve it, it is critical to analyze the properties of the problem. In this paper, we consider the image registration problem ...
In 2002, Murphy and Robshaw introduced an extension BES of AES and argued this could compromise the security of AES. We introduce here two block-ciphers CES and big-BES that are some extensions of the AES and BES respectively in the spirit of Hensel liftin ...
We describe how we reached a new factoring milestone by completing the first special number field sieve factorization of a number having more than 1024 bits, namely the Mersenne number 21039 -1. Although this factorization is orders of magnitude ...
Source localization from EEG surface measurements is an important problem in neuro-imaging. We propose a new mathematical framework to estimate the parameters of a multidipole source model. To that aim, we perform 2-D analytic sensing in multiple planes. ...
We report on our progress in reconstructing phylogenies from gene-order data. We have developed polynomial-time methods for estimating genomic distances that greatly improve the accuracy of trees obtained using the popular neighbor-joining method; we have ...
In this paper we propose a new structure for multiplication using optimal normal bases of type 2. The multiplier uses an efficient linear transformation to convert the normal basis representations of elements of Fqn to suitable polynomials of deg ...
Source localization from EEG surface measurements is an important problem in neuro-imaging. We propose a new mathematical framework to estimate the parameters of a multidipole source model. To that aim, we perform 2-D analytic sensing in multiple planes. T ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2008