Finding objects like music albums or wines in large databases is an inherently difficult problem, especially if users do not know exactly what they are looking for. We propose th...
: The aim of this paper is to compute of the generalized aspects, i.e. the maximal singularity-free domains in the Cartesian product of the joint space and workspace, for a planar ...
We present metric?? , a provably near-optimal algorithm for reinforcement learning in Markov decision processes in which there is a natural metric on the state space that allows t...
We consider the problem of constructing binary space partitions (BSPs) for orthogonal subdivisions (space filling packings of boxes) in d-space. We show that a subdivision with n...
Bookmarks are used as "personal Web information spaces" to help people remember and retrieve interesting Web pages. A study of personal Web information spaces surveyed 3...