Publications associées à Algorithme de Karatsuba

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, Christoph Ernst René Schäfer

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

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

Fast Interscale Wavelet Denoising of Poisson-Corrupted Images

Michaël Unser, Thierry Blu, Cédric René Jean Vonesch, Florian Luisier

We present a fast algorithm for image restoration in the presence of Poisson noise. Our approach is based on (1) the minimization of an unbiased estimate of the MSE for Poisson noise, (2) a linear parametrization of the denoising process and (3) the preser ...

Elsevier2010

Fast Detection of Cells Using a Continuously Scalable Mexican-Hat-Like Template

Michaël Unser, Daniel Sage, Kunal Narayan Chaudhury, Zsuzsanna Püspöki

We propose a fast algorithm for the detection of cells in fluorescence images. The algorithm, which estimates the number of cells and their respective centers and radii, relies on the fast computation of intensity-based correlations between the cells and a ...

IEEE2010

Faster Integer Multiplication

For more than 35 years, the fastest known method for integer multiplication has been the Schonhage-Strassen algorithm running in time O(n log n log log n). Under certain restrictive conditions, there is a corresponding Omega(n log n) lower bound. All this ...

2009

Bipartite modular multiplication method

Marcelo Kaihara

This paper proposes a new modular multiplication method that uses Montgomery residues defined by a modulus M and a Montgomery radix R whose value is less than the modulus M. This condition enables the operand multiplier to be split into two parts that can ...

2008

Learning Multi-Modal Dictionaries

Pierre Vandergheynst, Gianluca Monaci, Rémi Gribonval, Philippe Jost

Real-world phenomena involve complex interactions between multiple signal modalities. As a consequence, humans are used to integrate at each instant perceptions from all their senses in order to enrich their understanding of the surrounding world. This par ...

2007

Fast directional correlation on the sphere with steerable filters

Pierre Vandergheynst, Yves Wiaux, Laurent Jacques

A fast algorithm is developed for the directional correlation of scalar band-limited signals and band-limited steerable filters on the sphere. The asymptotic complexity associated to it through simple quadrature is of order O(L^5), where 2L stands for the ...

2006

A new method for the inversion of interferometry data using basis functions derived from singular value decomposition of local measurements in tokamak plasmas

Ivo Furno, Henri Weisen, Roland Behn, Emiliano Fable, Alexey Zabolotskiy

A novel method for inverting time-resolved line-integrated interferometric plasma density measurements is described. The method uses singular value decomposition of local density profiles from Thomson scattering measurements obtained at low sampling rates ...

2005