We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ich...
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Samb...
The field of stochastic optimization studies decision making under uncertainty, when only probabilistic information about the future is available. Finding approximate solutions to...
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...
There is a large literature on the rate of convergence problem for general unconstrained stochastic approximations. Typically, one centers the iterate n about the limit point then...