Publications associées à Approximation Algorithms for Modern Multi-Processor Scheduling Problems

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.

Recompression Of Hadamard Products Of Tensors In Tucker Format

Daniel Kressner, Lana Perisa

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

USSR: An UltraSound Sparse Regularization framework

Jean-Philippe Thiran, Yves Wiaux, Dimitris Perdios, Marcel Arditi, Adrien Georges Jean Besson, Florian Martinez

Ultrafast ultrasound (US) imaging uses unfocused waves to insonify the whole medium of interest at once, allowing pulse-echo US imaging to achieve very high frame rates, at the cost of a lower image quality. In this paper, we present USSR, an UltraSound Sp ...

Ieee2017

Collision-Free Pattern Formation

Rachid Guerraoui, Alexandre David Olivier Maurer

Shoals of small fishes can change their collective shape and form a specific pattern. They do so efficiently (in parallel) and without collision. In this paper, we study the analog problem of distributed pattern formation. A set of processes needs to move ...

2016

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. [2012] ...

Assoc Computing Machinery2016

Capacity and Data Complexity in Multidimensional Linear Attack

Serge Vaudenay, Jialin Huang

Multidimensional linear attacks are one of the most powerful variants of linear cryptanalytic techniques now. However, there is no knowledge on the key-dependent capacity and data complexity so far. Their values were assumed to be close to the average valu ...

Springer2015

Maximizing Symmetric Submodular Functions

Moran Feldman

Symmetric submodular functions are an important family of submodular functions capturing many interesting cases including cut functions of graphs and hypergraphs. In this work, we identify submodular maximization problems for which one can get a better app ...

Springer Int Publishing Ag2015

Towards Tight Lower Bounds for Scheduling Problems

Ashkan Norouzi Fard, Abbas Bazzi

We show a close connection between structural hardness for k-partite graphs and tight inapproximability results for scheduling problems with precedence constraints. Assuming a natural but nontrivial generalisation of the bipartite structural hardness resul ...

Springer Int Publishing Ag2015

Multi-Objective Quality-Driven Service Selection-A Fully Polynomial Time Approximation Scheme

Boi Faltings, Immanuel Trummer

The goal of multi-objective quality-driven service selection (QDSS) is to find service selections for a workflow whose quality-of-service (QoS) values are Pareto-optimal. We consider multiple QoS attributes such as response time, cost, and reliability. A s ...

Institute of Electrical and Electronics Engineers2014

Approximation Algorithms for Modern Multi-Processor Scheduling Problems

Graph Chatbot

Chattez avec Graph Search

Recompression Of Hadamard Products Of Tensors In Tucker Format

USSR: An UltraSound Sparse Regularization framework

Pattern formation with voluminous processes

Collision-Free Pattern Formation

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

Capacity and Data Complexity in Multidimensional Linear Attack

Maximizing Symmetric Submodular Functions

Towards Tight Lower Bounds for Scheduling Problems

Sparse Group Covers and Greedy Tree Approximations

Multi-Objective Quality-Driven Service Selection-A Fully Polynomial Time Approximation Scheme

Recompression Of Hadamard Products Of Tensors In Tucker Format

USSR: An UltraSound Sparse Regularization framework

Collision-Free Pattern Formation

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

Capacity and Data Complexity in Multidimensional Linear Attack

Maximizing Symmetric Submodular Functions

Sparse Group Covers and Greedy Tree Approximations

Multi-Objective Quality-Driven Service Selection-A Fully Polynomial Time Approximation Scheme

Pattern formation with voluminous processes

Towards Tight Lower Bounds for Scheduling Problems