Anna Atramentov

Learn More
We describe an efficient implementation (MRDTL-2) of the Multi-relational decision tree learning (MRDTL) algorithm [19] which in turn was based on a proposal by Knobbe et al. [15] We describe some simple techniques for speeding up the calculation of sufficient statistics for decision trees and related hypothesis classes from multi-relational data. Because(More)
We present and implement an efficient algorithm for performing nearest-neighbor queries in topological spaces that usually arise in the context of motion planning. Our approach extends the Kd tree-based ANN algorithm , which was developed by Arya and Mount for Eu-clidean spaces. We argue the correctness of the algorithm and illustrate its efficiency through(More)
  • 1