Abstract: In this paper, we propose three modular multiplication algorithms that use only the IEEE 754 binary floating-point operations. Several previous studies have used floating-point operations to ...

The positron emission tomography (PET) problem with Poisson log-likelihood is notoriously ill-conditioned. This stems from its dependence on the inverse of the measured counts and the square of the ...

There might be an opportunity to consolidate. AFAIK, Fermat plus addition chain should be fastest. For our fixed parameter P256 implementation, we invert either modulo p or n. We already have a fixed ...

All legged robots deployed “in the wild” to date were given a body plan that was predefined by human designers and could not be redefined in situ. The manual and permanent nature of this process has ...

This repository contains the hardware design files and verification environment for the MT-TMVP (Modular Tiled Toeplitz Matrix-Vector Polynomial) multiplication algorithm, which is proposed and ...

Discovering faster algorithms for matrix multiplication remains a key pursuit in computer science and numerical linear algebra. Since the pioneering contributions of Strassen and Winograd in the late ...

Google DeepMind’s AI systems have taken big scientific strides in recent years — from predicting the 3D structures of almost every known protein in the universe to forecasting weather more accurately ...

According to Google DeepMind, AlphaEvolve has successfully discovered multiple new algorithms for matrix multiplication, surpassing the previous AlphaTensor model in efficiency and performance (source ...