edge distance-balanced graphs are graphs in which for every edge $e = uv$ the number of edges closer to vertex $u$ than to vertex $v$ is equal to the number of edges closer to $v$ than to $u$. in this paper, we study this property under some graph operations.

This paper proposes an adaptive Mahalanobis distance for face retrieval. The distance is derived from a posterior distribution of observation errors in features categorized by con dence of face images. Since the distance is calculated considering error variances of each dimension according to the con dence, it can re ect error distribution of each matching more precisely than a standard Mahalan...

All over the world, distance mode of education is gaining a momentum and becoming more popular than conventional education. It is a system in which schools, universities and other educational agencies offer instruction wholly or partly by mail. Eritrea is a newly independent country in Africa is been facing many challenges particularly in its education sector. It did not have more educational i...

This paper presents a method for learning distance functions of arbitrary feature representations that is based on the concept of wormholes. We introduce wormholes and describe how it provides a method for warping the topology of visual representation spaces such that a meaningful distance between examples is available. Additionally, we show how a more general distance function can be learnt th...

The purpose of this article is to examine the foundational principles and practices of distance education in the context of recent developments in the areas of online learning. The point is made that online learning had its genesis apart from mainstream distance education. As a result, it is argued that distance education has not fully embraced the collaborative potential of online learning. Th...

The problem of identifying clusters from MIMO measurement data is addressed. Conventionally, visual inspection has been used for cluster identification, but this approach is impractical for a large amount of measurement data. For automatic clustering, the multipath component distance (MCD) is used to calculate the distance between individual multipath components estimated by a channel parameter...

Repeated imaging observations of NGC 4395 were made with the WIYN 3.5 m and the KPNO 2.1 m telescopes. From the photometry of the resolved brighter stars in this galaxy eleven Cepheids with periods ranging between 12 and 90 days have been identified. The true distance modulus has been derived from the apparent distance moduli in g, r and i.

Mass spectrometry data is inherently uncertain. Rather than compare peak heights across samples, a comparison can be made of the relative ordering of the peak height across samples. Order statistics are used to provide a distance metric between each ordered list of peak heights from the samples. A principal component analysis is performed on the set of distance vectors to highlight to important...