For an integer k > 0, a graph G is k-triangular if every edge of G lies in at least k distinct 3-cycles of G. In (J Graph Theory 11:399–407 (1987)), Broersma and Veldman propo...
In this paper we present an algorithm for parametrizing approximate algebraic surfaces by lines. The algorithm is applicable to -irreducible algebraic surfaces of degree d having ...
Abstract. A resource selection probability function is a function that gives the probability that a resource unit (e.g., a plot of land) that is described by a set of habitat varia...
It is well known that on a line, a target point in unknown position can be found by walking a path at most 9 times as long as the distance from the start to the target point, in t...
Christoph A. Hipke, Christian Icking, Rolf Klein, ...
A minimum generation error (MGE) criterion had been proposed to solve the issues related to maximum likelihood (ML) based HMM training in HMM-based speech synthesis. In this paper...