Publications related to Greedy algorithm

An online-offline homogenization strategy to solve quasilinear two-scale problems at the cost of one-scale problems

Inspired by recent analyses of the finite element heterogeneous multiscale method and the reduced basis technique for nonlinear problems, we present a simple and concise finite element algorithm for the reliable and efficient resolution of elliptic or para ...

Wiley-Blackwell2014

Near-Optimally Teaching the Crowd to Classify

Andreas Krause, Amin Karbasi, Ilija Bogunovic

How should we present training examples to learners to teach them classification rules? This is a natural problem when training workers for crowdsourcing labeling tasks, and is also moti- vated by challenges in data-driven online educa- tion. We propose a ...

2014

Right-Protected Data Publishing with Provable Distance-Based Mining

Michail Vlachos, Nikolaos Freris

Protection of one's intellectual property is a topic with important technological and legal facets. We provide mechanisms for establishing the ownership of a dataset consisting of multiple objects. The algorithms also preserve important properties of the d ...

Ieee Computer Soc2014

High-Throughput Maps on Message-Passing Manycore Architectures: Partitioning versus Replication

André Schiper, Thomas Ropars, Omid Shahmirzadi

The advent of manycore architectures raises new scalability challenges for concurrent applications. Implementing scalable data structures is one of them. Several manycore architectures provide hardware message passing as a means to efficiently exchange dat ...

2014

High-Throughput Maps on Message-Passing Manycore Architectures: Partitioning versus Replication

André Schiper, Thomas Ropars, Omid Shahmirzadi

2014

Reduced basis method for the Stokes equations in decomposable parametrized domains using greedy optimization

Alfio Quarteroni, Gianluigi Rozza, Laura Iapichino

Flow simulations in pipelined channels and several kinds of parametrized configurations have a growing interest in many life sciences and industrial applications. Applications may be found in the analysis of the blood flow in specific compartments of the c ...

Springer2014

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

Combinatorial Algorithm for Restricted Max-Min Fair Allocation

Ola Nils Anders Svensson, Christos Kalaitzis, Chidambaram Annamalai

We study the basic allocation problem of assigning resources to players so as to maximize fairness. This is one of the few natural problems that enjoys the intriguing status of having a better estimation algorithm than approximation algorithm. Indeed, a ce ...

2014

Jump-Sparse and Sparse Recovery Using Potts Functionals

Martin Kurt Storath

We recover jump-sparse and sparse signals from blurred incomplete data corrupted by (possibly non-Gaussian) noise using inverse Potts energy functionals. We obtain analytical results (existence of minimizers, complexity) on inverse Potts functionals and pr ...

Ieee-Inst Electrical Electronics Engineers Inc2014

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Greedy algorithm

Route choice models: bringing behavioral aspects into shortest path

An online-offline homogenization strategy to solve quasilinear two-scale problems at the cost of one-scale problems

Near-Optimally Teaching the Crowd to Classify

Right-Protected Data Publishing with Provable Distance-Based Mining

High-Throughput Maps on Message-Passing Manycore Architectures: Partitioning versus Replication

High-Throughput Maps on Message-Passing Manycore Architectures: Partitioning versus Replication

Reduced basis method for the Stokes equations in decomposable parametrized domains using greedy optimization

Centrality of Trees for Capacitated k-Center

Combinatorial Algorithm for Restricted Max-Min Fair Allocation

Jump-Sparse and Sparse Recovery Using Potts Functionals

Graph Chatbot

Chat with Graph Search

Right-Protected Data Publishing with Provable Distance-Based Mining

Centrality of Trees for Capacitated k-Center

Combinatorial Algorithm for Restricted Max-Min Fair Allocation

Near-Optimally Teaching the Crowd to Classify

High-Throughput Maps on Message-Passing Manycore Architectures: Partitioning versus Replication

An online-offline homogenization strategy to solve quasilinear two-scale problems at the cost of one-scale problems

Jump-Sparse and Sparse Recovery Using Potts Functionals

Reduced basis method for the Stokes equations in decomposable parametrized domains using greedy optimization

Route choice models: bringing behavioral aspects into shortest path

High-Throughput Maps on Message-Passing Manycore Architectures: Partitioning versus Replication