When searching for place entities such as businesses or points of interest, the desired place may be close (finding the nearest ATM) or far away (finding a hotel in another city). Understanding the role of distance in predicting user interests can guide ...

By extending the notion of minimum rank distance, this paper introduces two new relative code parameters of a linear code C₁ of length n over a field extension F_q^m and its subcode C₂ ⊆ C₁. One ...

Many recent block ciphers use Maximum Distance Separable (MDS) matrices in their diffusion layer. The main objective of this operation is to spread as much as possible the differences between the outputs of nonlinear Sboxes. So they generally act at ...

In various research fields a common task is to summarize the information shared by a collection of objects and to find a consensus of them. In many scenarios, the object items for which a consensus needs to be determined are rankings, and the process is ...

This paper aims to present two clustering methods based on rank distance. The K-means algorithm represents each cluster by a single mean vector. The mean vector is computed with respect to a distance measure. A new K-means algorithm based on rank ...

This paper introduces a new rank-based approach of the cosine similarity that can be applied in the competitive area of automatic classification. We describe the method and then we present some of its mathematical and computational properties. Tests are ...

This paper aims to present two clustering methods based on rank distance. Rank distance has applications in many different fields such as computational linguistics, biology and informatics. Rank distance can be computed fast and benefits from some ...

Spearman distance is a permutation distance which might be used for codes in permutations beside Kendall distance. However, Spearman distance gives rise to a geometry of strings, which is rather unruly from the point of view of error correction and ...

This paper aims to fully present a new genetic approach that uses rank distance for solving two known NP complete problems: closest string and closest sub string. We build a genetic algorithm for each of the two problems and we describe the genetic ...

The Rank Distance is a relatively new metric being used in genomic applications that has good potential, excellent computational properties and known limitations. This paper proposes a refinement to the standard Rank Distance in order to overcome some ...

The problem of error correction in both coherent and noncoherent network coding is considered under an adversarial model. For coherent network coding, where knowledge of the network topology and network code is assumed at the source and destination ...

XML query languages use directional path expressions to locate data in an XML data collection. They are tightly coupled to the structure of a data collection, and can fail when evaluated on the same data in a different structure. This paper extends path ...

The multi-criteria decision making process can be summarized as follows. Given a pattern d and a set C = {c$_1$, c$_2$, …, c$_m$} of allmpossible categories of d, we are interested in predicting its class by using a set of n classifiers l$_1$, l$_2$, …, ...

The multi-criteria decision making process can be summarized as follows. Given a pattern d and a set C = {c$_1$, c$_2$, …, c$_m$} of allmpossible categories of d, we are interested in predicting its class by using a set of n classifiers l$_1$, l$_2$, …, ...

We exhibit a low-complexity but non-trivial distance between strings to be used in biology. The experimental results we provide were obtained on a standard laptop and, even if preliminary, are quite encouraging.

We exhibit a low-complexity but non-trivial distance between strings to be used in biology. The experimental results we provide were obtained on a standard laptop and, even if preliminary, are quite encouraging.

In this paper we present an aggregation method which can be applied to classifications having different vocabularies. The method uses the rank distance (Dinu, 2003), a metric which measures the similarity between two hierarchies based on the ranks of ...

In this paper we present an aggregation method which can be applied to classifications having different vocabularies. The method uses the rank distance (Dinu, 2003), a metric which measures the similarity between two hierarchies based on the ranks of ...