Publications related to Computational complexity of mathematical operations

A 16-bit Floating-Point Near-SRAM Architecture for Low-power Sparse Matrix-Vector Multiplication

David Atienza Alonso, Giovanni Ansaloni, Grégoire Axel Eggermann, Marco Antonio Rios

State-of-the-art Artificial Intelligence (AI) algorithms, such as graph neural networks and recommendation systems, require floating-point computation of very large matrix multiplications over sparse data. Their execution in resource-constrained scenarios, ...

2023

Why computational complexity may set impenetrable barriers for epistemic reductionism

Michael Herzog, Christian Sachse, Adrien Christophe Doerig

According to physicalism, everything is physical or metaphysically connected to the physical. If physicalism were true, it seems that we should - in principle - be able to reduce the descriptions and explanations of special sciences to physical ones, for e ...

Dordrecht2023

Comparison of regression techniques for generating surrogate models to predict the thermodynamic behavior of biomass gasification systems

François Maréchal, Daniel Alexander Florez Orrego, Meire Ellen Gorete Ribeiro Domingos, Julia Granacher

Biomass resources can play an important role in the energy transition, being a dynamic feedstock that can be transformed either into solid, liquid or gaseous fuels. Biomass gasification is a versatile way to convert waste into energy. In this work, the mod ...

2023

Comparison of regression techniques for generating surrogate models to predict the thermodynamic behavior of biomass gasification systems

François Maréchal, Daniel Alexander Florez Orrego, Meire Ellen Gorete Ribeiro Domingos, Julia Granacher

Biomass resources can play an important role in the energy transition, being a dynamic feedstock that can be transformed either into solid, liquid or gaseous fuels. The biomass gasification is a versatile way to convert wastes into energy. In this work, th ...

Elsevier2023

Iterative refinement of Schur decompositions

Daniel Kressner, Zvonimir Bujanovic

The Schur decomposition of a square matrix A is an important intermediate step of state-of-the-art numerical algorithms for addressing eigenvalue problems, matrix functions, and matrix equations. This work is concerned with the following task: Compute a (m ...

SPRINGER2022

Differentially Private Release of Synthetic Graphs

Mikhail Kapralov, Marek Elias

We propose a (epsilon, delta)-differentially private mechanism that, given an input graph G with n vertices and m edges, in polynomial time generates a synthetic graph G' approximating all cuts of the input graph up to an additive error of O (root mn/epsil ...

ASSOC COMPUTING MACHINERY2020

Optimal Hybrid Perimeter and Switching Plans Control for Urban Traffic Networks

Nikolaos Geroliminis, Jack Haddad, Mohammadreza Hajiahmadi

Since centralized control of urban networks with detailed modeling approaches is computationally complex, developing efficient hierarchical control strategies based on aggregate modeling is of great importance. The dynamics of a heterogeneous large-scale u ...

Institute of Electrical and Electronics Engineers2015

Block-Floating-Point Enhanced MMSE Filter Matrix Computation for MIMO-OFDM Communication Systems

Andreas Peter Burg, Carl Christian Sten Dominic Senning

n this paper we present an architecture for an MMSE ﬁlter matrix computation unit for signal detection in MIMO-OFDM communication systems. We propose to compute the required matrix inverse based on a Cholesky decomposition, followed by a Gauss-Jordan matri ...

2013

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.

Computational complexity of mathematical operations

A 16-bit Floating-Point Near-SRAM Architecture for Low-power Sparse Matrix-Vector Multiplication

Why computational complexity may set impenetrable barriers for epistemic reductionism

Comparison of regression techniques for generating surrogate models to predict the thermodynamic behavior of biomass gasification systems

Comparison of regression techniques for generating surrogate models to predict the thermodynamic behavior of biomass gasification systems

Iterative refinement of Schur decompositions

Differentially Private Release of Synthetic Graphs

Permutation-based Decoding of Reed-Muller Codes in Binary Erasure Channel

Optimal Hybrid Perimeter and Switching Plans Control for Urban Traffic Networks

Generalised Mersenne Numbers Revisited

Block-Floating-Point Enhanced MMSE Filter Matrix Computation for MIMO-OFDM Communication Systems

Graph Chatbot

Chat with Graph Search

Why computational complexity may set impenetrable barriers for epistemic reductionism

Comparison of regression techniques for generating surrogate models to predict the thermodynamic behavior of biomass gasification systems

Differentially Private Release of Synthetic Graphs

A 16-bit Floating-Point Near-SRAM Architecture for Low-power Sparse Matrix-Vector Multiplication

Permutation-based Decoding of Reed-Muller Codes in Binary Erasure Channel

Optimal Hybrid Perimeter and Switching Plans Control for Urban Traffic Networks

Comparison of regression techniques for generating surrogate models to predict the thermodynamic behavior of biomass gasification systems

Iterative refinement of Schur decompositions

Generalised Mersenne Numbers Revisited

Block-Floating-Point Enhanced MMSE Filter Matrix Computation for MIMO-OFDM Communication Systems