Concept

Greedy algorithm

Related publications (331)

Sparse Group Covers and Greedy Tree Approximations

We consider the problem of finding a K-sparse approximation of a signal, such that the support of the approximation is the union of sets from a given collection, a.k.a. group structure. This problem subsumes the one of finding K-sparse tree approximations. ...

2015

Optimal Layered Representation for Adaptive Interactive Multiview Video Streaming

Pascal Frossard, Thomas Maugey, Nikolaos Thomos, Laura Toni, Ana Karina De Abreu Goes

We consider an interactive multiview video streaming (IMVS) system where clients select their preferred viewpoint in a given navigation window. To provide high quality IMVS, many high quality views should be transmitted to the clients. However, this is not ...

Elsevier2015

Optimized Coding Strategies for Interactive Multiview Video

Ana Karina De Abreu Goes

The natural next step in improving the realistic experience in multimedia services is interactive multiview video (IMV). IMV promises to enable the users to freely navigate through a scene by selecting their preferred viewpoints from any view position for ...

EPFL2015

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

Transfer Learning through Greedy Subset Selection

Barbara Caputo, Ilja Kuzborskij

In this work we study the binary transfer learning problem involving 10^2 -10^3 sources. We focus on how to select sources from the large pool and how to combine them to yield a good performance on a target task. In particular, we consider the transfer lea ...

Idiap2015

Reduced basis finite element heterogeneous multiscale method for quasilinear elliptic homogenization problems

Assyr Abdulle, Gilles Vilmart, Yun Bai

A reduced basis finite element heterogeneous multiscale method (RB-FE-HMM) for a class of nonlinear homogenization elliptic problems of nonmonotone type is introduced. In this approach, the solutions of the micro problems needed to estimate the macroscopic ...

Amer Inst Mathematical Sciences2015

Localizing Polygonal Objects in Man-Made Environments

Xiaolu Sun

Object detection is a significant challenge in Computer Vision and has received a lot of attention in the field. One such challenge addressed in this thesis is the detection of polygonal objects, which are prevalent in man-made environments. Shape analysis ...

EPFL2015

MATHICSE Technical Report : Reduced basis approximation and a posteriori error estimates for parametrized elliptic eigenvalue problems

Andrea Manzoni, Nicola Parolini

We develop a new reduced basis (RB) method for the rapid and reliable approximation of parametrized elliptic eigenvalue problems. The method hinges upon dual weighted residual type a posteriori error indicators which estimate, for any value of the paramete ...

MATHICSE2015

Prioritized Random MAC Optimization via Graph-based Analysis

Pascal Frossard, Laura Toni

Motivated by the analogy between successive interference cancellation and iterative belief-propagation on erasure channels, irregular repetition slotted ALOHA (IRSA) strategies have received a lot of attention in the design of medium access control protoco ...

Institute of Electrical and Electronics Engineers2015

MATHICSE Technical Report : A reduced basis finite element heterogeneous multiscale method for Stokes flow in porous media

Assyr Abdulle, Ondrej Budác

A reduced basis Darcy-Stokes finite element heterogeneous multiscale method (RB-DS-FE-HMM) is proposed for the Stokes problem in porous media. The multiscale method is based on the Darcy-Stokes finite element heterogeneous multiscale method (DS-FE-HMM) int ...

MATHICSE2015

Graph Chatbot

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.