This document denotes the typos in the following paper: N. Ohkura, K. Hirata, T. Kuboyama, M. Harao: The q-Gram Distance for Ordered Unlabeled Trees, Proc. 8th International Conference on Discover Science (DS2005), LNAI, Springer-Verlag, 2005 (to appear). 1 Section 2, the First Paragraph Please replace the first paragraph with the following statements. A tree is a connected graph without cycles...

We study the parameterized complexity of dominating sets in geometric intersection graphs. In one dimension, we investigate intersection graphs induced by translates of a fixed pattern Q that consists of a finite number of intervals and a finite number of isolated points. We prove that Dominating Set on such intersection graphs is polynomially solvable whenever Q contains at least one interval,...

Considering an interatomic potential $U(\mathbf{q})$, where $\mathbf{q}=[{\mathbf{q}}_{1},{\mathbf{q}}_{2},\ensuremath{\cdots},{\mathbf{q}}_{N}]\ensuremath{\in}{\mathbb{R}}^{3N}$ is a vector describing positions ${\mathbf{q}}_{i}\ensuremath{\in}{\mathbb{R}}^{3}$, it shown that $U$ can be defined as function of the distance variables ${r}_{ij}=|{\mathbf{q}}_{i}\ensuremath{-}{\mathbf{q}}_{j}|$ pr...

This paper starts by considering the minimization of the Rényi divergence subject to a constraint on the total variation distance. Based on the solution of this optimization problem, the exact locus of the points ( D(Q∥P1), D(Q∥P2) ) is determined when P1, P2, Q are arbitrary probability measures which are mutually absolutely continuous, and the total variation distance between P1 and P2 is not...

Let [n, k, d]q code be a linear code of length n, dimension k and minimum Hamming distance d over GF (q). One of the basic and most important problems in coding theory is to construct codes with best possible minimum distances. In this paper seven quasi-twisted ternary linear codes are constructed. These codes are new and improve the best known lower bounds on the minimum distance in [6]. 2010 ...

We use the SLAC lattice QCD theory to compute the large distance contribution to the process q+p + qH +q, +X, where qH is a heavy quark. In this way, we complete the usual short distance analysis of this process. The relationship between our completion and observation is discussed. Submitted to Progress of Theoretical Physics * Work supported by the Department of Energy, contract DE AC03 76SF00...

Given two simple polygons P and Q we de ne the weight of a bridge p q with p P and q Q where de nes the boundary of the polygon between the two polygons as gd p P d p q gd q Q where d p q is the Euclidean distance between the points p and q and gd a A is the geodesic distance between a and its geodesic farthest neighbor on A An optimal bridge of minimum weight can be found in O n log n time as ...

Computing the Fréchet distance between two polygonal curves H Alt, M Godau International Journal of Computational Geometry & ..., 1995 World Scientific As a measure for the resemblance of curves in arbitrary dimensions we consider the socalled Fréchet-distance, which is compatible with parametrizations of the curves. For polygonal chains P and Q consisting of p and q edges an algorithm of runti...

Let [n, k, d]q-code be a linear code of length n, dimension k and minimum Hamming distance d over GF (q). One of the most important problems in coding theory is to construct codes with best possible minimum distances. Recently, the class of quasi-cyclic (QC) codes has been proven to contain many such codes. In this paper, thirty two codes over GF (8) are constructed (among them one optimal code...

Let C be a convex body. By the relative distance of points p and q we mean the ratio of the Euclidean distance of p and q to the half of the Euclidean length of a longest chord of C parallel to pq. The aim of the paper is to find upper bounds for the minimum of the relative lengths of the sides of convex hexagons and