Abstract We develop a distance metric for clustering and classification algorithms which is invariant to affine transformations and includes priors on the transformation parameters...
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
Thomas Erlebach, Michael Hoffmann 0002, Danny Kriz...
Metric distances and the more general concept of dissimilarities are widely used tools in instance-based learning methods and very especially in the nearestneighbor classification...
Given two sets of points in the plane, we are interested in locating a highway h such that an objective function on the city distance between points of the two sets is minimized (w...
—Estimating latency between the hosts in the Internet can play a significant role in the improvement of the performance of many services that use latency among hosts to make rout...