We present a Simplex-type algorithm, that is, an algorithm that moves from one extreme point of the infinite-dimensional feasible region to another not necessarily adjacent extrem...
We present two modifications to the popular k-means clustering algorithm to address the extreme requirements for latency, scalability, and sparsity encountered in user-facing web...
The paper provides a systematic way for finding a partial differential equation that directly characterizes the optimal control, in the framework of one
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
Tomas Brazdil, Vaclav Brozek, Kousha Etessami, Ant...
We present a minimax framework for classification that considers stochastic adversarial perturbations to the training data. We show that for binary classification it is equivale...