Abstract. The Kaczmarz method for solving linear systems of equations Ax = b is an iterative algorithm that has found many applications ranging from computer tomography to digital ...
We present an algorithm called Optimistic Linear Programming (OLP) for learning to optimize average reward in an irreducible but otherwise unknown Markov decision process (MDP). O...
: This work is about an algorithm for solving a linear program which is simple to apply. There are three algorithms in this work. The first algorithm solves a two-variable linear p...
Kernel techniques have long been used in SVM to handle linearly inseparable problems by transforming data to a high dimensional space, but training and testing large data sets is ...
Online boosting methods have recently been used successfully for tracking, background subtraction etc. Conventional online boosting algorithms emphasize on interchanging new weak ...