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.
In-plane linear displacements of microelectromechanical systems are measured with subnanometer accuracy by observing periodic micropatterns with a CCD camera attached to an optical microscope. The translation of the microstructure is retrieved from the vid ...
Institute of Electrical and Electronics Engineers2010
A method and system for computing Fourier coefficients for a Fourier representation of a mask transmission function for a lithography mask. The method includes: sampling a polygon of a mask pattern of the lithography mask to obtain an indicator function wh ...
A fast computational method is given for the Fourier transform of the polyharmonic B-spline autocorrelation sequence in d dimensions. The approximation error is exponentially decaying with the number of terms taken into account. The algorithm improves spee ...
Institute of Electrical and Electronics Engineers2008
The goal of transductive learning is to find a way to recover the labels of lots of data with only a few known samples. In this work, we will work on graphs for two reasons. First, it’s possible to construct a graph from a given dataset with features. The ...
We study a multichannel sampling scheme, where different channels observe scaled and shifted versions of a common bandlimited signal. The channel gains and offsets are unknown a priori, and each channel samples at sub-Nyquist rates. This setup appears in m ...
NOVELTY - The watermark is made imperceptible, e.g. invisible or inaudible, by inserting it into selected parts of the data that are neither significant nor insignificant perceptually. Examples for the domain of embedding are complex Fourier coefficients a ...
We present a theory of fast and perfect detector components that extends the theory of detectors and correctors of Arora and Kulkarni, and based on which, we develop an algorithm that automatically transforms a fault-intolerant program into a fail-safe fau ...
Frequency-domain implementations improve the computational efficiency and the convergence rate of adaptive schemes. This paper develops frequency-domain adaptive structures that are based on the trigonometric transforms DCT and DST. The structures involve ...
We present a straightforward method for measuring in-plane linear displacements of microelectromechanical systems (MEMS) with a subnanometer resolution. The technique is based on Fourier transform analysis of a video recorded with a Charge-Coupled Device ( ...
We present a novel, accurate and fast algorithm to obtain Fourier series coecients from an IC layer whose description consists of rectilinear polygons on a plane, and how to implement it using o-the-shelf hardware components. Based on properties of Fourier ...