Publications related to Greedy coloring

Efficient greedy algorithms for high-dimensional parameter spaces with applications to empirical interpolation and reduced basis methods

We propose two new and enhanced algorithms for greedy sampling of high- dimensional functions. While the techniques have a substantial degree of generality, we frame the discussion in the context of methods for empirical interpolation and the devel- opment ...

EDP Sciences2014

Frequency capping in online advertising

Moran Feldman

We study the following online problem. There are n advertisers. Each advertiser has a total demand and a value for each supply unit. Supply units arrive one by one in an online fashion, and must be allocated to an agent immediately. Each unit is associated ...

Springer2014

Optimal Classification In Sparse Gaussian Graphic Model

Zhigang Yao, Yingying Fan

Consider a two-class classification problem where the number of features is much larger than the sample size. The features are masked by Gaussian noise with mean zero and covariance matrix Sigma, where the precision matrix Omega = Sigma(-1) is unknown but ...

Institute of Mathematical Statistics2013

On some coloring problems in grids

Dominique de Werra

We study complexity issues related to some coloring problems in grids: we examine in particular the case of List coloring, of Precoloring extension and of (p, q)-List coloring, the case of List coloring in bipartite graphs where lists in the first part of ...

2013

Fast Proximal algorithms for Self-concordant function minimization with application to sparse graph selection

Volkan Cevher, Anastasios Kyrillidis

The convex

\ell_1

-regularized

\log\det

divergence criterion has been shown to produce theoretically consistent graph learning. However, this objective function is challenging since the

\ell_1

-regularization is nonsmooth, the

\log\det

objective is n ...

2013

Fast Proximal Algorithms For Self-Concordant Function Minimization With Application To Sparse Graph Selection

Volkan Cevher, Anastasios Kyrillidis

The convex l(1)-regularized log det divergence criterion has been shown to produce theoretically consistent graph learning. However, this objective function is challenging since the l(1)-regularization is nonsmooth, the log det objective is not globally Li ...

IEEE2013

A note on chromatic properties of threshold graphs

Dominique de Werra, Bernard Ries, Rico Zenklusen

In threshold graphs one may find weights for the vertices and a threshold value t such that for any subset S of vertices, the sum of the weights is at most the threshold t if and only if the set S is a stable (independent) set. In this note we ask a simila ...

2012

Coloring fuzzy circular interval graphs

Friedrich Eisenbrand, Martin Niemeier

Given a graph G with nonnegative node labels w, a multiset of stable sets S_1,...,S_k\subseteq V(G) such that each vertex v \in V(G) is contained in w(v) many of these stable sets is called a weighted coloring. The weighted coloring number \chi_w(G) is the ...

Elsevier2012

Pipeline Synthesis and Optimization of FPGA-based Video Processing Applications with CAL

Marco Mattavelli, Ab Al Hadi Bin Ab Rahman, Anatoly Prihozhy

This paper describes a pipeline synthesis and optimization technique that increases data throughput of FPGA-based system using minimum pipeline resources. The technique is applied on \CAL dataflow language, and designed based on relations, matrices and gra ...

Hindawi Publishing Corporation2011

A Variational Framework for Structure from Motion in Omnidirectional Image Sequences

Pascal Frossard, Pierre Vandergheynst, Luigi Bagnato

We address the problem of depth and ego-motion estimation from omnidirectional images. We propose a correspondence-free structure from motion problem for images mapped on the 2-sphere. A novel graph-based variational framework is proposed for depth estimat ...

Springer Verlag2011

Greedy coloring

Graph Chatbot

Chat with Graph Search

Efficient greedy algorithms for high-dimensional parameter spaces with applications to empirical interpolation and reduced basis methods

Frequency capping in online advertising

Optimal Classification In Sparse Gaussian Graphic Model

On some coloring problems in grids

Fast Proximal algorithms for Self-concordant function minimization with application to sparse graph selection

Fast Proximal Algorithms For Self-Concordant Function Minimization With Application To Sparse Graph Selection

A note on chromatic properties of threshold graphs

Coloring fuzzy circular interval graphs

Pipeline Synthesis and Optimization of FPGA-based Video Processing Applications with CAL

A Variational Framework for Structure from Motion in Omnidirectional Image Sequences

Optimal Classification In Sparse Gaussian Graphic Model

Frequency capping in online advertising

On some coloring problems in grids

Fast Proximal algorithms for Self-concordant function minimization with application to sparse graph selection

A note on chromatic properties of threshold graphs

Efficient greedy algorithms for high-dimensional parameter spaces with applications to empirical interpolation and reduced basis methods

Fast Proximal Algorithms For Self-Concordant Function Minimization With Application To Sparse Graph Selection

Coloring fuzzy circular interval graphs

Pipeline Synthesis and Optimization of FPGA-based Video Processing Applications with CAL

A Variational Framework for Structure from Motion in Omnidirectional Image Sequences