Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Table de multiplication

Publications associées (10)

Computational Imaging SPAD Cameras

Andrei Ardelean

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

Lower bounds for Pythagoras numbers of function fields

David Maximilian Grimm

We show that the transcendence degree of a real function field over an arbitrary real base field is a strict lower bound for its Pythagoras number and a weak lower bound for all its higher Pythagoras numbers. ...

European Mathematical Soc2015

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

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

Faster Integer Multiplication

For more than 35 years, the fastest known method for integer multiplication has been the Schonhage-Strassen algorithm running in time O(n log n log log n). Under certain restrictive conditions, there is a corresponding Omega(n log n) lower bound. All this ...

2009

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

Yusuf Leblebici, Paolo Ienne, 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

Publications associées (10)

Computational Imaging SPAD Cameras

Andrei Ardelean

EPFL2023

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

David Valentin Strütt

EPFL2018

Lower bounds for Pythagoras numbers of function fields

David Maximilian Grimm

European Mathematical Soc2015

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

Optical Society of America2011

Discrete choice models with multiplicative error terms

Michel Bierlaire

2009

Faster Integer Multiplication

2009

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

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

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

Lippincott, Williams & Wilkins2005