Publications related to Karatsuba algorithm

EdgeAI-Aware Design of In-Memory Computing Architectures

Driven by the demand for real-time processing and the need to minimize latency in AI algorithms, edge computing has experienced remarkable progress. Decision-making AI applications stand out for their heavy reliance on data-centric operations, predominantl ...

EPFL2024

MRI artifact correction using sparse plus low-rank decomposition of annihilating filter-based hankel matrix

Kyong Hwan Jin

PurposeMagnetic resonance imaging (MRI) artifacts are originated from various sources including instability of an magnetic resonance (MR) system, patient motion, inhomogeneities of gradient fields, and so on. Such MRI artifacts are usually considered as ir ...

Wiley2017

Fast Computation Of Spectral Projectors Of Banded Matrices

Daniel Kressner, Ana Susnjara

We consider the approximate computation of spectral projectors for symmetric banded matrices. While this problem has received considerable attention, especially in the context of linear scaling electronic structure methods, the presence of small relative s ...

Siam Publications2017

Target-based fiber assignment for large survey spectrographs

Jean-Paul Richard Kneib, Laleh Makarem

Next generation massive spectroscopic survey projects have to process a massive amount of targets. The preparation of subsequent observations should be feasible in a reasonable amount of time. We present a fast algorithm for target assignment that scales a ...

Spie-Int Soc Optical Engineering2016

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

Fast Directional Spatially Localized Spherical Harmonic Transform

Yves Wiaux, Jason Douglas McEwen

We propose a transform for signals defined on the sphere that reveals their localized directional content in the spatio-spectral domain when used in conjunction with an asymmetric window function. We call this transform the directional spatially localized ...

Institute of Electrical and Electronics Engineers2013

An Efficient Algorithm for Level Set Method Preserving Distance Function

Jean-Philippe Thiran, Xavier Bresson, Dominique Zosso, Virginia Estellers Casas

The level set method is a popular technique for tracking moving interfaces in several disciplines including computer vision and fluid dynamics. However, despite its high flexibility, the original level set method is limited by two important numerical issue ...

Institute of Electrical and Electronics Engineers2012

Computing exact Fourier series coefficients of IC rectilinear polygons from low-resolution fast Fourier coefficients

Paul Hurley, Robin Scheibler

We present a novel, accurate and fast algorithm to obtain Fourier series coecients from an IC layer whose description consists of rectilinear polygons on a plane, and how to implement it using o-the-shelf hardware components. Based on properties of Fourier ...

2012

Constrained expectation-maximization algorithm for stochastic inertial error modeling: study of feasibility

Jan Skaloud, Stéphane Guerrier, Yannick Stebler

Stochastic modeling is a challenging task for low-cost sensors whose errors can have complex spectral structures. This makes the tuning process of the INS/GNSS Kalman filter often sensitive and difficult. For example, first-order Gauss–Markov processes are ...

Institute of Physics2011

On Improving Face Detection Performance by Modelling Contextual Information

Sébastien Marcel, Cosmin Atanasoaei

In this paper we present a new method to enhance object detection by removing false alarms and merging multiple detections in a principled way with few parameters. The method models the output of an object classiï¬er which we consider as the context. A hie ...

Idiap2010

Karatsuba algorithm

Graph Chatbot

Chat with Graph Search

EdgeAI-Aware Design of In-Memory Computing Architectures

MRI artifact correction using sparse plus low-rank decomposition of annihilating filter-based hankel matrix

Fast Computation Of Spectral Projectors Of Banded Matrices

Target-based fiber assignment for large survey spectrographs

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

Fast Directional Spatially Localized Spherical Harmonic Transform

An Efficient Algorithm for Level Set Method Preserving Distance Function

Computing exact Fourier series coefficients of IC rectilinear polygons from low-resolution fast Fourier coefficients

Constrained expectation-maximization algorithm for stochastic inertial error modeling: study of feasibility

On Improving Face Detection Performance by Modelling Contextual Information

EdgeAI-Aware Design of In-Memory Computing Architectures

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

MRI artifact correction using sparse plus low-rank decomposition of annihilating filter-based hankel matrix

Target-based fiber assignment for large survey spectrographs

An Efficient Algorithm for Level Set Method Preserving Distance Function

Constrained expectation-maximization algorithm for stochastic inertial error modeling: study of feasibility

Fast Directional Spatially Localized Spherical Harmonic Transform

Fast Computation Of Spectral Projectors Of Banded Matrices

Computing exact Fourier series coefficients of IC rectilinear polygons from low-resolution fast Fourier coefficients

On Improving Face Detection Performance by Modelling Contextual Information