Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
For~q a prime power, the discrete logarithm problem (DLP) in~\Fq consists in finding, for any g∈Fq× and h∈⟨g⟩, an integer~x such that gx=h. We present an algorithm for computing discrete logarithm ...
We review spectral methods for the solution of hyperbolic problems. To keep the discussion concise, we focus on Fourier spectral methods and address key issues of accuracy, stability, and convergence of the numerical approximations. Polynomial methods are ...
In multiview applications, camera views can be used as reference views to synthesize additional virtual viewpoints, allowing users to freely navigate within a 3D scene. However, bandwidth constraints may restrict the number of reference views sent to clien ...
We analyze the stability and accuracy of discrete least squares on multivariate poly- nomial spaces to approximate a given function depending on a multivariate random variable uniformly distributed on a hypercube. The polynomial approximation is calculated ...
For any positive integers n≥3,r≥1 we present formulae for the number of irreducible polynomials of degree n over the finite field F2r where the coefficients of xn−1, xn−2 and xn−3 are zero. Our proofs involve coun ...
Let k be a global field of characteristic not 2, and let f is an element of k[X] be an irreducible polynomial. We show that a non-degenerate quadratic space has an isometry with minimal polynomial f if and only if such an isometry exists over all the compl ...
Let X be a finite set and let k be a commutative ring. We consider the k-algebra of the monoid of all relations on X, modulo the ideal generated by the relations factorizing through a set of cardinality strictly smaller than Card(X), called inessential rel ...
We are interested in the approximation of partial differential equations on domains decomposed into two (or several) subdomains featuring non-conforming interfaces. The non-conformity may be due to different meshes and/or different polynomial degrees used ...
We analyze the accuracy of the discrete least-squares approximation of a function u in multivariate polynomial spaces PΛ:=span{y↦yν∣ν∈Λ} with Λ⊂N0d over the domain Γ:=[−1,1]d, based on the sa ...
We analyze the stability and accuracy of discrete least squares on multivariate polynomial spaces to approximate a given function depending on a multivariate random variable uniformly distributed on a hypercube. The polynomial approximation is calculated s ...