e # where fo#]m range over continuous and increasing functions with foEqpDHrIs"t#!foE]u4HrIs"87q#nmnEgp HvIw" and mnE]u4HrIw$A7 . The functions fo#]m are also called parametrization functions. For polygonal curves x and y , consisting of z and { edges, Alt and Godau [2] developed an algorithm which computes their Fréchet distance in time |XEBz {>}~D€5EBz { H]H . We will review this algorithm i...

For a vertex v of a connected oriented graph D and an ordered set W = {w1, w2, . . . , wk} of vertices of D, the (directed distance) representation of v with respect to W is the ordered k-tuple r(v ∣ ∣ W ) = (d(v,w1), d(v, w2), . . . , d(v, wk)), where d(v, wi) is the directed distance from v to wi. The set W is a resolving set for D if every two distinct vertices of D have distinct representat...

In this paper, we study a class of two sample test statistics based on inter-point distances in the high dimensional and low/medium size setting. Our include well-known energy distance maximum mean discrepancy with Gaussian Laplacian kernels, critical values are obtained via permutations. We show that all these tests inconsistent when distributions correspond to same marginal but differ other a...

Keywords: Linear codes MDS-codes AMS Subject classiication (1985) 94B05 Summary: We give several bounds for the length, dimension or minimum distance of linear block codes whose dimension equals the minimum distance of their dual codes. Zusammenfassung: Wir geben verschiedene Schranken f ur die L ange, die Dimension und den Minimalabstand linearer Blockcodes, deren Dimension gleich dem Mini-mal...