We analyze the faces of the dual Koch arrangement, which is the arrangem...
The Matoušek LP-type problems were used by Matoušek to show that the
Sha...
The ARRIVAL problem is to decide the fate of a train moving along the ed...
A unique sink orientation (USO) is an orientation of the hypercube graph...
Consider a community where initially, each individual is positive or neg...
Tverberg's theorem is one of the cornerstones of discrete geometry. It s...
We study the computational complexity of ARRIVAL, a zero-player game on
...
Consider a graph G=(V,E) and a random initial vertex-coloring, where eac...
Consider a graph G=(V,E) and an initial random coloring where each verte...
We propose a new framework for deriving screening rules for convex
optim...
A function f: R^d →R is a Sparse Additive
Model (SPAM), if it is of the ...
A function f: R^d →R is referred to as a
Sparse Additive Model (SPAM), i...
We consider a stochastic continuum armed bandit problem where the arms a...
For a wide variety of regularization methods, algorithms computing the e...
For a variety of regularized optimization problems in machine learning,
...