Concept

Algorithme de multiplication d'entiers

Publications associées (142)

Large Sieve Inequalities for Algebraic Trace Functions

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

Quantization Design for Distributed Optimization

Colin Neil Jones, Ye Pu, Melanie Nicole Zeilinger

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

Fast Segmentation from Blurred Data in 3D Fluorescence Microscopy

Michaël Unser, Martin Kurt Storath

We develop a fast algorithm for segmenting 3D images from linear measurements based on the Potts model (or piecewise constant Mumford-Shah model). To that end, we first derive suitable space discretizations of the 3D Potts model, which are capable of deali ...

2017

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

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

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

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 ...

Wiley-Blackwell2016

Parsing human skeletons in an operating room

Pascal Fua, Slobodan Ilic, Xinchao Wang, Horesh Beny Ben Shitrit, Vasileios Belagiannis

Multiple human pose estimation is an important yet challenging problem. In an Operating Room (OR) environment, the 3D body poses of surgeons and medical staff can provide important clues for surgical workflow analysis. For that purpose, we propose an algor ...

Springer Verlag2016

Fast generation of lexicographic satisfiable assignments: enabling canonicity in SAT-based applications

Giovanni De Micheli, Paolo Ienne, Mathias Soeken, Ana Petkovska

Lexicographic Boolean satisfiability (LEXSAT) is a variation of the Boolean satisfiability problem (SAT). Given a variable order, LEXSAT finds a satisfying assignment whose integer value under the given variable order is minimum (maximum) among all satisfi ...

Assoc Computing Machinery2016

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

MATHICSE Technical Report : Accelerated filtering on graphs using Lanczos method

Pierre Vandergheynst, Daniel Kressner, Nathanaël Perraudin, Ana Susnjara

Sinal-processing on graphs has developed into a very active field of research during the last decade. In particular, the number of applications using frames con-structed from graphs, like wavelets on graphs, has substantially increased. To attain scalabili ...

MATHICSE2015

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

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