Concept

Croix de multiplication

Publications associées (15)

Computational Imaging SPAD Cameras

Vision systems built around conventional image sensors have to read, encode and transmit large quantities of pixel information, a majority of which is redundant. As a result, new computational imaging sensor architectures were developed to preprocess the r ...

EPFL2023

Sur quelques équations aux dérivées partielles en lien avec le lemme de Poincaré

David Valentin Strütt

In this thesis, we study two distinct problems. The first problem consists of studying the linear system of partial differential equations which consists of taking a k-form, and applying the exterior derivative 'd' to it and add the wedge product with a 1- ...

EPFL2018

Generalised Mersenne Numbers Revisited

Robert Granger

Generalised Mersenne Numbers (GMNs) were defined by Solinas in 1999 and feature in the NIST (FIPS 186-2) and SECG standards for use in elliptic curve cryptography. Their form is such that modular reduction is extremely efficient, thus making them an attrac ...

2013

Tunable multiplication of the repetition rate of an optical pulse train using dynamic Brillouin gratings in optical fibers

Luc Thévenaz, Sang Hoon Chin, Nikolay Primerov

We here propose a novel technique for realizing the multiplication of the pulse repetition rate with a flexibly tunable multiplication factor, based on dynamic Brillouin grating (DBG) reflectors implemented in highly birefringent fibers. ...

Optical Society of America2011

Multilevel Schwarz methods for elliptic partial differential equations

Alfio Quarteroni, Giovanni Migliorati

We investigate multilevel Schwarz domain decomposition preconditioners, to efficiently solve linear systems arising from numerical discretizations of elliptic partial differential equations by the finite element method. In our analysis we deal with unstruc ...

Elsevier2011

Discrete choice models with multiplicative error terms

Michel Bierlaire

The conditional indirect utility of many random utility maximization (RUM) discrete choice models is specified as a sum of an index V depending on observables and an independent random term. In general, the universe of RUM consistent models is much larger, ...

2009

Architectural improvements for field programmable counter arrays: enabling efficient synthesis of fast compressor trees on FPGAs

Paolo Ienne, Yusuf Leblebici, Philip Brisk, Alessandro Cevrero, Ajay Kumar Verma, Hadi Parandeh Afshar, Panagiotis Athanasopoulos

The Field Programmable Counter Array (FPCA) was introduced to improve FPGA performance for arithmetic circuits. An FPCA is a reconfigurable IP core that can be integrated into an FPGA. To exploit the FPCA, a circuit is transformed by merging disparate addi ...

ACM2008

Discrete choice models with multiplicative error terms

Michel Bierlaire

The conditional indirect utility of many random utility maximization (RUM) discrete choice models is specified as a sum of an index V depending on observables and an independent random term P. In general, the universe of RUM consistent models is much large ...

2007

Efficient multiplication using type $2$ optimal normal bases

Mohammad Amin Shokrollahi

In this paper we propose a new structure for multiplication using optimal normal bases of type

2

. The multiplier uses an efficient linear transformation to convert the normal basis representations of elements of

F_{q^{n}}

to suitable polynomials of deg ...

2007

Noise-enhanced computation in a model of a cortical column

Wulfram Gerstner, Julien Mayor

Varied sensory systems use noise in order to enhance detection of weak signals. It has been conjectured in the literature that this effect, known as stochastic resonance, may take place in central cognitive processes such as memory retrieval of arithmetica ...

Lippincott, Williams & Wilkins2005

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.

Connectez-vous pour utiliser Chat avec Graph Search

Efficient multiplication using type $2$ optimal normal bases

Mohammad Amin Shokrollahi

In this paper we propose a new structure for multiplication using optimal normal bases of type

2

. The multiplier uses an efficient linear transformation to convert the normal basis representations of elements of

F_{q^{n}}

to suitable polynomials of deg ...

2007