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.
The notion of similarity between texts is fundamental for many applications of Natural Language Processing. For example, this notion is particularly useful for the applications designed for the management of information in large textual databases, such as ...
The authors investigate the classification of power system states using an artificial neural network model, Kohonen's self-organizing feature map. The ultimate goal of this classification is to assess power system static security in real-time. Kohonen's se ...
The invention concerns novel constructs and novel vectors for the targeted and inducible expression of genes. It describes in particular novel hybrid promoters and their use for the expression of genes in hepatic cells, in vitro, ex vivo or in vivo ...
We discuss a class of non-Markovian continuous time random walks on the infinite one-dimensional lattice. The pausing time distribution which governs the dynamics is chosen to be of the Erlang type (i.e. gamma of integer order). We derive a generalized mas ...
Using simple examples and informal discussions this article surveys the key ideas and major advances of the last quarter century in integer factorization. ...
We develop an algorithm for solving a system of diophantine equations with lower and upper bounds on the variables. The algorithm is based on lattice basis reduction. It first finds a short vector satisfying the system of diophantine equations, and a set o ...
We describe a single-instruction multiple data (SIMD) implementation of the multiple polynomial quadratic sieve integer factoring algorithm. On a 16K MasPar massively parallel computer, the implementation can factor 100 digit integers in a few days. Its mo ...
Shamir (1993) presented a family of cryptographic signature schemes based on birational permutations of the integers modulo a large integer N of unknown factorization. These schemes are attractive because of the low computational requirements, both ...
We consider the following integer feasibility problem: Given positive integer numbers a0, a1,&mellip;,an with gcd(a1,&mellip;,an) = 1 and a = (a1,&mellip;,an), does there exist a ...
The number field sieve is an algorithm to factor integers of the form re−s for small positive r and s. The authors present a report on work in progress on this algorithm. They informally describe the algorithm, discuss several implementation related ...
