Each kd tree subdivision of the data used by PROC LOESS is placed in a kdTree table. The predicted values at the vertices of each kd tree are placed in a PredAtVertices table. These tables can be ...

The aim of this paper is to present an exact exponential time algorithm for the GMST problem as well three efficient algorithms, two of them based on Prim's and Kruskal's algorithms for the minimum ...