Algorithms for the Computation of Continuous Transforms of Rectilinear Polygons from IC Layouts
Graph Chatbot
Chat with Graph Search
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 investigate the use of overcomplete frame representations to correct errors occurring over burst-based transmission channels or channels leading to isolated errors. We show that when the overcomplete signal representation is based on a class of frames, ...
We provide a method for constructing regular sampling lattices in arbitrary dimensions together with an integer dilation matrix. Subsampling using this dilation matrix leads to a similarity-transformed version of the lattice with a chosen density reduction ...
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 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 ...
Any solution of the Navier–Stokes equations in a three-dimensional axisymmetric domain admits a Fourier expansion with respect to the angular variable, and it can be noted that each Fourier coefficient satisfies a variational problem on the meridian domain ...
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 multiresolution spaces of complex rotation-covariant functions, deployed on the 2-D hexagonal lattice. The designed wavelets, which are complex-valued, provide an important phase information for image analysis, which is missing in the discrete w ...
A multi-stage secret sharing (MSS) scheme is a method of sharing a number of secrets among a set of participants, such that any authorized subset of participants could recover one secret in every stage. The first MSS scheme was proposed by He and Dawson in ...
We propose a Fourier analytical condition linking alias-free sampling with the Fourier transform of the indicator function defined on the given frequency support. Our discussions center around how to develop practical computation algorithms based on the pr ...
Institute of Electrical and Electronics Engineers2009
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
