A path from a point s to a point t on the surface of a polyhedral terrain is said to be descent if for every pair of points p = (x(p), y(p), z(p)) and q = (x(q), y(q), z(q)) on th...
In this paper we present a general framework for the comparison of intervals when preference relations have to established. The use of intervals in order to take into account impr...
We describe a recursive algorithm to quickly compute the N nearest neighbors according to a similarity measure in a metric space. The algorithm exploits an intrinsic property of a...
In a recent paper Keister proposed two quadrature rules as alternatives to Monte Carlo for certain multidimensional integrals and reported his test results. In earlier work we had...
Spectral methods for nonlinear dimensionality reduction (NLDR) impose a neighborhood graph on point data and compute eigenfunctions of a quadratic form generated from the graph. W...