A novel AI-acceleration paper presents a method to optimize sparse matrix multiplication for machine learning models, particularly focusing on structured sparsity. Structured sparsity involves a ...

Abstract Let A be an n × n Hermitian matrix and A = UΛUH be its spectral decomposition, where U is a unitary matrix of order n and Λ is a diagonal matrix. In this note we present the perturbation ...

Mathematicians love a good puzzle. Even something as abstract as multiplying matrices (two-dimensional tables of numbers) can feel like a game when you try to find the most efficient way to do it.

Computer scientists are a demanding bunch. For them, it’s not enough to get the right answer to a problem — the goal, almost always, is to get the answer as efficiently as possible. Take the act of ...