—We investigate the problem of retrieving similar shapes from a large database; in particular, we focus on medical tumor shapes (“Find tumors that are similar to a given patter...
Most data mining operations include an integral search component at their core. For example, the performance of similarity search or classification based on Nearest Neighbors is ...
Similarity search has been proved suitable for searching in very large collections of unstructured data objects. We are interested in efficient parallel query processing under si...
— This paper describes a new extension to the Rapidly–exploring Random Tree (RRT) path planning algorithm. The Particle RRT algorithm explicitly considers uncertainty in its do...
Abstract— We present a path planning algorithm for a polyhedral robot with six degrees of freedom (6DOF) and a static obstacle. The planner consists of a dual-tree RRT algorithm ...