Publications related to Strassen algorithm

Deterministic Algorithms for Submodular Maximization Problems

Randomization is a fundamental tool used in many theoretical and practical areas of computer science. We study here the role of randomization in the area of submodular function maximization. In this area, most algorithms are randomized, and in almost all c ...

ASSOC COMPUTING MACHINERY2018

Fast iterative retrieval algorithm for ultrashort pulse characterization using dispersion scans

We present an iterative retrieval algorithm based on data constraint for ultrashort pulse characterization using dispersion scan (d-scan). The proposed algorithm is much faster and leads to a drastic reduction of retrieval times, but, compared to the stand ...

Optical Society of America2017

Efficient Online Processing for Advanced Analytics

Mohamed Elsayed Mohamed Ahmed El Seidy

With the advent of emerging technologies and the Internet of Things, the importance of online data analytics has become more pronounced. Businesses and companies are adopting approaches that provide responsive analytics to stay competitive in the global ma ...

EPFL2017

Faster ECC over $\mathbb{F}_{2^{521}-1}$

Robert Granger

In this paper we present a new multiplication algorithm for residues modulo the Mersenne prime

2^{521}−1

. Using this approach, on an Intel Haswell Core i7-4770, constant-time variable-base scalar multiplication on NIST’s (and SECG’s) curve P-521 requires ...

Springer Berlin Heidelberg2015

Role of sampling in evaluating classical time autocorrelation functions

Jiri Vanicek, Tomas Zimmermann

We analyze how the choice of the sampling weight affects efficiency of the Monte Carlo evaluation of classical time autocorrelation functions. Assuming uncorrelated sampling or sampling with constant correlation length, we propose a sampling weight for whi ...

American Institute of Physics2013

A geometric framework for registration of sparse images

Pascal Frossard, Alhussein Fawzi

We examine the problem of image registration when images have a sparse representation in a dictionary of geometric features. We propose a novel algorithm for aligning images by pairing their sparse components. We show numerically that this algorithm works ...

2013

Universal and efficient compressed sensing by spread spectrum and application to realistic Fourier imaging techniques

Pierre Vandergheynst, Yves Wiaux, Rémi Gribonval, Gilles Puy

We advocate a compressed sensing strategy that consists of multiplying the signal of interest by a wide bandwidth modulation before projection onto randomly selected vectors of an orthonormal basis. Firstly, in a digital setting with random modulation, con ...

Institute of Electrical and Electronics Engineers2012

Spread Spectrum for Universal Compressive Sampling

Pierre Vandergheynst, Yves Wiaux, Rémi Gribonval, Gilles Puy

We propose a universal and efficient compressive sampling strategy based on the use of a spread spectrum technique. The method essentially consists in a random pre-modulation of the signal of interest followed by projections onto randomly selected vectors ...

2011

Structured Derivation of Semi-Synchronous Algorithms

André Schiper, Martin Hutle, Zarko Milosevic, Fatemeh Borran, Hagit Albo Attiya

The semi-synchronous model is an important middle ground between the synchronous and the asynchronous models of distributed computing. In this model, processes can detect (timeout) when other processes fail. However, since detection is done by timing out, ...

2011

Efficient and side-channel-aware implementations of elliptic curve cryptosystems over prime fields

Yusuf Leblebici

Elliptic curve cryptosystems (ECCs) are utilised as an alternative to traditional public-key cryptosystems, and are more suitable for resource-limited environments because of smaller parameter size. In this study, the authors carry out a thorough investiga ...

2010

Strassen algorithm

Graph Chatbot

Chat with Graph Search

Deterministic Algorithms for Submodular Maximization Problems

Fast iterative retrieval algorithm for ultrashort pulse characterization using dispersion scans

Efficient Online Processing for Advanced Analytics

Faster ECC over $\mathbb{F}_{2^{521}-1}$

Role of sampling in evaluating classical time autocorrelation functions

A geometric framework for registration of sparse images

Universal and efficient compressed sensing by spread spectrum and application to realistic Fourier imaging techniques

Spread Spectrum for Universal Compressive Sampling

Structured Derivation of Semi-Synchronous Algorithms

Efficient and side-channel-aware implementations of elliptic curve cryptosystems over prime fields

Fast iterative retrieval algorithm for ultrashort pulse characterization using dispersion scans

Faster ECC over $\mathbb{F}_{2^{521}-1}$

Efficient Online Processing for Advanced Analytics

Deterministic Algorithms for Submodular Maximization Problems

Role of sampling in evaluating classical time autocorrelation functions

A geometric framework for registration of sparse images

Universal and efficient compressed sensing by spread spectrum and application to realistic Fourier imaging techniques

Spread Spectrum for Universal Compressive Sampling

Structured Derivation of Semi-Synchronous Algorithms

Efficient and side-channel-aware implementations of elliptic curve cryptosystems over prime fields