Concept

Multiplication

Related publications (55)

Accelerator-driven Data Arrangement to Minimize Transformers Run-time on Multi-core Architectures

David Atienza Alonso, Giovanni Ansaloni, Alireza Amirshahi

The increasing complexity of transformer models in artificial intelligence expands their computational costs, memory usage, and energy consumption. Hardware acceleration tackles the ensuing challenges by designing processors and accelerators tailored for t ...

2024

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

Fabrication and Characterization of High Aspect Ratio Amorphous Silicon Based Microchannel Plates

Christophe Ballif, Janina Christine Isabelle Löffler, Samira Alexandra Frey, Mohammad Beygi

This contribution focuses on the fabrication and characterization of microchannel plates made of hydrogenated amorphous silicon (AMCPs). Flexible fabrication processes and the semi-conducting nature of amorphous silicon could give these detectors the advan ...

2021

Collaborative Learning in the Jungle (Decentralized, Byzantine, Heterogeneous, Asynchronous and Nonconvex Learning)

Rachid Guerraoui, Sadegh Farhadkhani, El Mahdi El Mhamdi, Le Nguyen Hoang, Sébastien Louis Alexandre Rouault, Arsany Hany Abdelmessih Guirguis

We study Byzantine collaborative learning, where n nodes seek to collectively learn from each others' local data. The data distribution may vary from one node to another. No node is trusted, and f < n nodes can behave arbitrarily. We prove that collaborati ...

2021

A Structure Theorem for Level Sets of Multiplicative Functions and Applications

Florian Karl Richter

Given a level set E of an arbitrary multiplicative function f, we establish, by building on the fundamental work of Frantzikinakis and Host [14, 15], a structure theorem that gives a decomposition of

1_{E}

into an almost periodic and a pseudo-random part ...

2020

Efficacy of a Computer-Based Learning Program in Children With Developmental Dyscalculia. What Influences Individual Responsiveness?

This study presents the evaluation of a computer-based learning program for children with developmental dyscalculia and focuses on factors affecting individual responsiveness. The adaptive training program Calcularis 2.0 has been developed according to cur ...

2020

Characterization of Amorphous Silicon Based Microchannel Plates with High Aspect Ratio

Christophe Ballif, Janina Christine Isabelle Löffler

Microchannel plates (MCPs) fabricated out of hydrogenated amorphous silicon offer a promising alternative to conventional lead glass ones. Progress in the fabrication process has allowed for detectors with higher aspect ratios, which significantly increase ...

IEEE2019

Reducing the Multiplicative Complexity in Logic Networks for Cryptography and Security Applications

Giovanni De Micheli, Mathias Soeken, Luca Gaetano Amarù, Eleonora Testa

Reducing the number of AND gates plays a central role in many cryptography and security applications. We propose a logic synthesis algorithm and tool to minimize the number of AND gates in a logic network composed of AND, XOR, and inverter gates. Our appro ...

ASSOC COMPUTING MACHINERY2019

The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits

Giovanni De Micheli, Mathias Soeken, Giulia Meuli

We present a constructive method to create quantum circuits that implement oracles vertical bar x vertical bar y |0 (k) -> vertical bar x vertical bar y circle plus f(x)vertical bar 0 (k) for n-variable Boolean functions f with low T-count. In our method f ...

IEEE2019

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

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.

A Structure Theorem for Level Sets of Multiplicative Functions and Applications

Florian Karl Richter

Given a level set E of an arbitrary multiplicative function f, we establish, by building on the fundamental work of Frantzikinakis and Host [14, 15], a structure theorem that gives a decomposition of

1_{E}

into an almost periodic and a pseudo-random part ...

2020