We consider the computational problem of finding nearest neighbors in general metric spaces. Of particular interest are spaces that may not be conveniently embedded or approximate...
Abstract— We present a novel approach to compute collisionfree paths for multiple robots subject to local coordination constraints. More specifically, given a set of robots, the...
Russell Gayle, William Moss, Ming C. Lin, Dinesh M...
Parallel computing has become an important research field in the last years. The availability of hardware and the success of grid computing have motivated this interest. In this pa...
—In hybrid Optical/packet networks, wavelength and VLAN tag continuity along a Label Switched Path are two common constraints. These two types of constraints, referred to as Gene...
This paper describes an algorithm for pose and illumination invariant face recognition from a single image under occlusions. The method iteratively estimates the parameters of a 3...