We present randomized algorithms for two sorting problems. In the local sorting problem, a graph is given in which each vertex is assigned an element of a total order, and the task...
There exist a number of reinforcement learning algorithms which learn by climbing the gradient of expected reward. Their long-run convergence has been proved, even in partially ob...
We consider broadcasting on asynchronous anonymous totally unoriented Nnode hypercubes. First we generalize a technique, introduced in 3 , for partial broadcasting and orientation...
Although optimizations have been applied for a number of years to improve the performance of software, problems that have been long-standing remain, which include knowing what opt...
A new paradigm for the efficient color-based tracking of objects seen from a moving camera is presented. The proposed technique employs the mean shift analysis to derive the targe...