Publications associées à MATHICSE Technical Report : Low-rank approximation in the Frobenius norm by column and row subset selection

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.

What's the Frequency, Kenneth?: Sublinear Fourier Sampling Off the Grid

Volkan Cevher, Yen-Huan Li

We design a sublinear Fourier sampling algorithm for a case of sparse off-grid frequency recovery. These are signals with the form ; i.e., exponential polynomials with a noise term. The frequencies satisfy and for some . We design a sublinear time randomiz ...

Springer Verlag2015

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

Asynchronized Concurrency: The Secret to Scaling Concurrent Search Data Structures

Rachid Guerraoui, Vasileios Trigonakis, Tudor Alexandru David

We introduce "asynchronized concurrency (ASCY),'' a paradigm consisting of four complementary programming patterns. ASCY calls for the design of concurrent search data structures (CSDSs) to resemble that of their sequential counterparts. We argue that ASCY ...

2015

Centrality of Trees for Capacitated k-Center

Ola Nils Anders Svensson, Hyung Chan An, Aditya Bhaskara

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

Stability Analysis of a Partitioned Fluid-Structure Thermal Coupling Algorithm

Pénélope Leyland, Ojas Joshi

Numerical multiphysics coupling is gaining more and more importance in engineering. Partitioned algorithms are among the most efficient methods to solve the coupled problem. However, they present some drawbacks, with the stability of the algorithm itself b ...

Amer Inst Aeronautics Astronautics2014

MATHICSE Technical Report : A continuation multilevel Monte Carlo algorithm

Fabio Nobile, Erik Gustaf Bogislaw Von Schwerin

We propose a novel Continuation Multi Level Monte Carlo (CMLMC) algorithm for weak approximation of stochastic models that are described in terms of differential equations either driven by random measures or with random coefficients. The CMLMC algorithm so ...

MATHICSE2014

Santa Claus Schedules Jobs On Unrelated Machines

Ola Nils Anders Svensson

One of the classic results in scheduling theory is the 2-approximation algorithm by Lenstra, Shmoys, and Tardos for the problem of scheduling jobs to minimize makespan on unrelated machines; i.e., job j requires time p(ij) if processed on machine i. More t ...

Siam Publications2012

Quasi-polynomial Local Search for Restricted Max-Min Fair Allocation

Ola Nils Anders Svensson, Lukas Polacek

The restricted max-min fair allocation problem (also known as the restricted Santa Claus problem) is one of few problems that enjoys the intriguing status of having a better estimation algorithm than approximation algorithm. Indeed, Asadpour et al. [1] pro ...

Springer2012

MATHICSE Technical Report : Low-rank approximation in the Frobenius norm by column and row subset selection

Graph Chatbot

Chattez avec Graph Search

What's the Frequency, Kenneth?: Sublinear Fourier Sampling Off the Grid

Centrality of trees for capacitated -center

Asynchronized Concurrency: The Secret to Scaling Concurrent Search Data Structures

Sensing the real world

Centrality of Trees for Capacitated k-Center

Stability Analysis of a Partitioned Fluid-Structure Thermal Coupling Algorithm

MATHICSE Technical Report : A continuation multilevel Monte Carlo algorithm

Overview of New Approaches for Approximating TSP

Santa Claus Schedules Jobs On Unrelated Machines

Quasi-polynomial Local Search for Restricted Max-Min Fair Allocation

Asynchronized Concurrency: The Secret to Scaling Concurrent Search Data Structures

What's the Frequency, Kenneth?: Sublinear Fourier Sampling Off the Grid

Centrality of Trees for Capacitated k-Center

Centrality of trees for capacitated -center

Stability Analysis of a Partitioned Fluid-Structure Thermal Coupling Algorithm

Sensing the real world

Quasi-polynomial Local Search for Restricted Max-Min Fair Allocation

MATHICSE Technical Report : A continuation multilevel Monte Carlo algorithm

Santa Claus Schedules Jobs On Unrelated Machines

Overview of New Approaches for Approximating TSP