Concept

In-place algorithm

Publications associées (58)

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

A bucket sort algorithm for the particle-in-cell method on manycore architectures

Laurent Villard, Stephan Brunner, Trach-Minh Tran, Claudio Gheller

The Particle-In-Cell (PIC) method is effectively used in many scientific simulation codes. In order to optimize the performance of the PIC approach, data locality is required. This relies on efficient sorting algorithms. We present a bucket sort algorithm ...

Springer2016

Solving the Shortest Vector Problem in 2^n Time via Discrete Gaussian Sampling

Divesh Aggarwal

We give a randomized 2^{n+o(n)}-time and space algorithm for solving the Shortest Vector Problem (SVP) on n-dimensional Euclidean lattices. This improves on the previous fastest algorithm: the deterministic O(4^n)-time and O(2^n)-space algorithm of Miccian ...

ACM2015

The $ L ^{ 1 } $ -Potts Functional for Robust Jump-Sparse Reconstruction

Martin Kurt Storath

We investigate the nonsmooth and nonconvex

L ^{ 1 }

-Potts functional in discrete and continuous time. We show Γ-convergence of discrete

L ^{ 1 }

-Potts functionals toward their continuous counterpart and obtain a convergence statement for the corr ...

SIAM2015

Unlabeled Sensing

Golnooshsadat Elhami

Like other data sensing problems, in unlabeled sensing, the target is to solve the equation y = Φx by finding vector x given a set of sample values in vector y as well as the matrix Φ. However, the main challenge in unlabeled sensing is that the correct or ...

2015

The L-1-Potts Functional For Robust Jump-Sparse Reconstruction

Martin Kurt Storath

We investigate the nonsmooth and nonconvex L-1-Potts functional in discrete and continuous time. We show Gamma-convergence of discrete L-1-Potts functionals toward their continuous counterpart and obtain a convergence statement for the corresponding minimi ...

Siam Publications2015

Centrality of trees for capacitated -center

Ola Nils Anders Svensson, Hyung Chan An, Aditya Bhaskara

We consider the capacitated -center problem. In this problem we are given a finite set of locations in a metric space and each location has an associated non-negative integer capacity. The goal is to choose (open) locations (called centers) and assign each ...

Springer Heidelberg2015

Modular multilevel battery packaging for a universal and flexible EVs charging system

Rosa Martel Danoary Tsirinomeny

Electric Vehicles (EVs) carmakers are heavily confronted by the limited fault ride-through capabilities of actual EVs battery packs. Therefore, this paper introduces a new method of EVs battery packaging based on modular multilevel battery modules as well ...

2014

, ,

We consider the capacitated k-center problem. In this problem we are given a finite set of locations in a metric space and each location has an associated non-negative integer capacity. The goal is to choose (open) k locations (called centers) and assign e ...

Springer2014

Compute-and-Forward: Finding the Best Equation

Michael Christoph Gastpar, Saeid Sahraei

Compute-and-Forward is an emerging technique to deal with interference. It allows the receiver to decode a suitably chosen integer linear combination of the transmitted messages. The integer coefficients should be adapted to the channel fading state. Optim ...

2014

, , , , , , , ,

Validation is arguably the bottleneck in the diffusion MRI community. This paper evaluates and compares 20 algorithms for recovering the local intra-voxel fiber structure from diffusion MRI data and is based on the results of the "HARDI reconstruction chal ...

Institute of Electrical and Electronics Engineers2014

The $ L ^{ 1 } $ -Potts Functional for Robust Jump-Sparse Reconstruction

Martin Kurt Storath

We investigate the nonsmooth and nonconvex

L ^{ 1 }

-Potts functional in discrete and continuous time. We show Γ-convergence of discrete

L ^{ 1 }

-Potts functionals toward their continuous counterpart and obtain a convergence statement for the corr ...

SIAM2015