Algorithms for the Computation of Continuous Transforms of Rectilinear Polygons from IC Layouts
Graph Chatbot
Chattez avec Graph Search
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.
{W}e compare four local feature extraction techniques for the task of face verification, namely (ordered in terms of complexity): raw pixels, raw pixels with mean removal, 2D Discrete Cosine Transform (DCT) and local Principal Component Analysis (PCA). The ...
We present a new family of two-dimensional and three-dimensional orthogonal wavelets which uses quincunx sampling. The orthogonal refinement filters have a simple analytical expression in the Fourier domain as a function of the order λ, which may be nonint ...
I. Introduction Wavelets are the result of collective efforts that recognized common threads between ideas and concepts that had been independently developed and investigated by distinct research communities. They provide a unifying framework for decompos ...
Efficient representation of visual information lies at the foundation of many image processing tasks, including compression, filtering, and feature extraction. Efficiency of a representation refers to the ability to capture significant information of an ob ...
We consider the Stokes problem in a three-dimensional axisymmetric domain and, by writing the Fourier expansion of its solution with respect to the angular variable, we observe that each Fourier coefficient satisfies a system of equations on the meridian d ...
We propose a multiplicative specification of a discrete choice model that renders choice probabilities independent of the scale of the utility. The scale can thus be random with unspecified distribution. The model mostly outperforms the classical additive ...
We present an explicit formula for B-spline convolution kernels; these are defined as the convolution of several B-splines of variable widths hi and degrees ni. We apply our results to derive spline-convolution-based algorithms for two closely related prob ...
This thesis presents a specialization of the integral equation (IE) method for the analysis of three-dimensional metallic and dielectric structures embedded in laterally unbounded (open) layered media. The method remains basically spatial but makes use of ...
In this paper, we introduce a novel algorithm to perform multi-scale Fourier transform analysis of piecewise stationary signals with application to automatic speech recognition. Such signals are composed of quasi-stationary segments of variable lengths. Th ...
We present ideas on how to structure software systems for high availability by considering MTTR/MTTF characteristics of components in addition to the traditional criteria, such as functionality or state sharing. Recursive restartability (RR), a recently pr ...
