A new framework is presented that uses tools from duality theory of linear programming to derive graph-cut based combinatorial algorithms for approximating NP-hard classification ...
Abstract. A strong vertex coloring of a hypergraph assigns distinct colors to vertices that are contained in a common hyperedge. This captures many previously studied graph colorin...
We study interval coloring problems and present new upper and lower bounds for several variants. We are interested in four problems, online coloring of intervals with and without b...
We present a globally convergent method for regularized risk minimization problems. Our method applies to Support Vector estimation, regression, Gaussian Processes, and any other ...
We study, from the competitive analysis perspective, the trade off between communication cost and delay cost (or simply the sendor-wait dilemma) on a hierarchy (rooted tree). The p...