We use game theory to analyze meta-learning algorithms. The objective of meta-learning is to determine which algorithm to apply on a given task. This is an instance of a more gene...
We analyze an extremely simple approximation algorithm for computing the minimum enclosing ball (or the 1-center) of a set of points in high dimensions. We prove that this algorit...
Probabilistic algorithms o er a means of computing that works with the grain of analogue hardware, rather than against it. This paper proposes the use of such an algorithm in appli...
Although a partially observable Markov decision process (POMDP) provides an appealing model for problems of planning under uncertainty, exact algorithms for POMDPs are intractable...
On screen division of objects for parallel volume rendering is considered in this paper. The suggested algorithm runs on private-memory based parallel computers. The notable chara...