Abstract: We present a combination of methods addressing the molecular distance problem, implemented on a graphic processing unit. First, we use geometric build-up and depth-first graph traversal.

A stochastic distance measure is defined for a general diffusion process on a parameter space X. This distance is defined by ds2=∑ gijdxidxj where (gij) is the inverse of the covariance matrix of the ...

The Earth is round but big, so we can consider it flat for short distances. But, even though the circumference of the Earth is about 40,000 kilometers, flat-Earth formulas for calculating the distance ...

The study of equiangular lines and distance sets has long captivated mathematicians through its elegant blend of geometry, algebra and combinatorics. Equiangular lines – sets of lines in Euclidean ...

Abstract: Qualifying the discrepancy between 3D geometric models, which could be represented with either point clouds or triangle meshes, is a pivotal issue with board applications. Existing methods ...

The notion of task similarity is at the core of various machine learning paradigms, such as domain adaptation and meta-learning. Current methods to quantify it are often heuristic, make strong ...