We present a heuristic algorithm to compute approximate geodesic distances on a triangular manifold S containing n vertices with partially missing data. The proposed method comput...
Zouhour Ben Azouz, Prosenjit Bose, Chang Shu, Stef...
In this paper we analyse a hybrid approximation of functions on the sphere S2 R3 by radial basis functions combined with polynomials, with the radial basis functions assumed to be...
The goal of approximate policy evaluation is to “best” represent a target value function according to a specific criterion. Temporal difference methods and Bellman residual m...
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
Abstract. We introduce a hybrid approach to magnetic resonance image segmentation using unsupervised clustering and the rules derived from approximate decision reducts. We utilize ...