Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Recherche

Afficher tous les résultats pour

Accueil

Concept

Algorithme de multiplication d'entiers

Science formelle
Mathématiques
Analyse (mathématiques)
Analyse numérique

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (29)

Page 2 sur 2

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

Large Sieve Inequalities for Algebraic Trace Functions

Philippe Michel, Ping Xi

The large sieve inequalities for algebraic trace functions are considered in this article. A fundamental iterative relation is established by classical Fourier analysis, and l-adic Fourier analysis and multiplicative convolutions of sheaves are also requir ...

Oxford Univ Press2017

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

Recompression Of Hadamard Products Of Tensors In Tucker Format

Daniel Kressner

The Hadamard product features prominently in tensor-based algorithms in scientific computing and data analysis. Due to its tendency to significantly increase ranks, the Hadamard product can represent a major computational obstacle in algorithms based on lo ...

Siam Publications2017

Quantization Design for Distributed Optimization

Colin Neil Jones, Melanie Nicole Zeilinger, Ye Pu

We consider the problem of solving a distributed optimization problem using a distributed computing platform, where the communication in the network is limited: each node can only communicate with its neighbors and the channel has a limited data-rate. A co ...

2017

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

Scalable splitting algorithms for big-data interferometric imaging in the SKA era

Jean-Philippe Thiran, Yves Wiaux, Jason Douglas McEwen, Rafael Eduardo Carrillo Rangel

In the context of next generation radio telescopes, like the Square Kilometre Array, the efficient processing of large-scale datasets is extremely important. Convex optimisation tasks under the compressive sensing framework have recently emerged and provid ...

OUP2016

Exact Algorithms for $ L ^{ 1 } $ -TV Regularization of Real-Valued or Circle-Valued Signals

Michaël Unser, Martin Kurt Storath

We consider

L ^{ 1 }

-TV regularization of univariate signals with values on the real line or on the unit circle. While the real data space leads to a convex optimization problem, the problem is nonconvex for circle-valued data. In this paper, we deriv ...

SIAM2016

Fast 3D reconstruction method for differential phase contrast X-ray CT

Michaël Unser, Michael Thompson McCann, Masih Nilchian

We present a fast algorithm for fully 3D regularized X-ray tomography reconstruction for both traditional and differential phase contrast measurements. In many applications, it is critical to reduce the X-ray dose while producing high-quality reconstructio ...

2016