We consider the problem of computing Fréchet distance between two curves for which exact locations vertices are unknown. Each vertex may be placed in a given uncertainty region that vertex, and objective is to place so as minimise distance. This was recently shown NP-hard 2D, it unclear how compute an optimal placement at all. present first general algorithmic framework this problem. prove resu...

The phenomenon of migration is addressed by several disciplines, such as demography, sociology, economics, political science and history. Therefore, a wide range analytical tools can be used to analyse this phenomenon. This study focuses primarily on regional capturing the dimension distance in empirical analysis. Cartograms migration, Webb diagrams that capture evolution net international inte...

Constant dimension codes, with a prescribed minimum distance, have found recently an application in network coding. All the codewords in such a code are subspaces of Fq with a given dimension. A computer search for large constant dimension codes is usually inefficient since the search space domain is extremely large. Even so, we found that some constant dimension lexicodes are larger than other...

The construction of codes in the projective space for error control in random networks has been the focus of recent research. The Plücker coordinate description of subspaces has been discussed in the context of constant dimension codes, as well as the Schubert cell description of certain code parameters. In this paper we use this classical tool to reformulate some standard constructions of cons...