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 consider the problem of uniform sampling of points on an algebraic variety. Specifically, we develop a randomized algorithm that, given a small set of multivariate polynomials over a sufficiently large finite field, produces a common zero of the polynom ...
For phase estimation in digital holographic interferometry, a high-order instantaneous moments (HIM) based method was recently developed which relies on piecewise polynomial approximation of phase and subsequent evaluation of the polynomial coefficients us ...
We generalize the basic results of Vinberg's theta-groups, or periodically graded reductive Lie algebras, to fields of good positive characteristic. To this end we clarify the relationship between the little Weyl group and the (standard) Weyl group. We ded ...
In this paper we tackle a variation of the Vehicle Routing Problem (VRP) in which each customer can be served by more than one vehicle, each serving a fraction of its demand. This problem is known as the Split Delivery VRP (SDVRP). Due to the potential sav ...
This paper examines the identification of a single-output two-input system. Motivated by an experiment design problem(should one excite the two inputs simultaneously or separately), we examine the effect of the (second) input signal on the variance of the ...
If phi is an excellent form, then it is possible to use the dimensions of the higher complements of phi to obtain an annihilating polynomial of phi of low degree. The main result of this paper is the construction of such a polynomial with the help of metho ...
We consider the problem of listing faces of the Minkowski sum of several V-polytopes in R^d. An algorithm for listing all faces of dimension up to j is presented, for any given 0
Computations of irregular primes and associated cyclotomic invariants were extended to all primes up to twelve million using multisectioning/convolution methods and a novel approach which originated in the study of Stickelberger codes (Shokrollahi (1996)). ...
We discuss interesting properties of a general technique for inferring polynomial invariants for a subfamily of imperative loops, called the P-solvable loops, with assignments only. The approach combines algorithmic combinatorics, polynomial algebra and co ...
Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2008
We consider the following problem: Given a rational matrix A∈Qm×n and a rational polyhedron Q⊆Rm+p, decide if for all vectors b∈Rm, for which there exists an integral z∈Zp suc ...