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.
We present and analyze a novel wavelet-Fourier technique for the numerical treatment of multidimensional advection–diffusion–reaction equations based on the COmpRessed SolvING (CORSING) paradigm. Combining the Petrov–Galerkin technique with the compressed ...
We consider rank-1 lattices for integration and reconstruction of functions with series expansion supported on a finite index set. We explore the connection between the periodic Fourier space and the non-periodic cosine space and Chebyshev space, via tent ...
Kaiser-Bessel window functions are frequently used to discretize tomographic problems because they have two desirable properties: 1) their short support leads to a low computational cost and 2) their rotational symmetry makes their imaging transform indepe ...
We introduce a new volumetric sheen BRDF that approximates scattering observed in surfaces covered with normally-oriented fibers. Our previous sheen model was motivated by measured cloth reflectance, but lacked significant backward scattering. The model pr ...
Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for dimensionality reduction of time-series using contrastive learning. A method can include receiving multidimensional input time series data that includes ...
We consider rank-1 lattices for integration and reconstruction of functions with series expansion supported on a finite index set. We explore the connection between the periodic Fourier space and the non-periodic cosine space and Chebyshev space, via tent ...
Inexact circuits and approximate computing have been gaining a lot of interest in order to improve performances and energy efficiency beyond the boundaries of conventional digital circuits. Image and video processing is one of the best candidate for applyi ...
The discrete cosine transform (DCT) is known to be asymptotically equivalent to the Karhunen-Loève transform (KLT) of Gaussian first-order auto-regressive (AR(1)) processes. Since being uncorrelated under the Gaussian hypothesis is synonymous with independ ...
Sinusoidal transforms such as the DCT are known to be optimal—that is, asymptotically equivalent to the Karhunen-Loève transform (KLT)—for the representation of Gaussian stationary processes, including the classical AR(1) processes. While the KLT remains ...
Sinusoidal transforms such as the DCT are known to be optimal-that is, asymptotically equivalent to the Karhunen-Loeve transform (KLT)-for the representation of Gaussian stationary processes, including the classical AR(1) processes. While the KLT remains a ...