Results 11 to 20 of about 619,850 (264)
The minimum miss distance problem [PDF]
Proceedings of the American Mathematical Society, 1967 I. In the statement of most extant theorems concerning optimal control, a fundamental hypothesis is that of the existence of a control function which drives the controlled system from a given initial state to a specified target. Thus the utility of these theorems is contingent upon the solution of what is itself a fundamental and difficult problem of ...
Bridgland, T. F. jun., Hinkel, J. S.
openaire +1 more source
Minimum local distance density estimation [PDF]
Communications in Statistics - Theory and Methods, 2016 We present a local density estimator based on first order statistics. To estimate the density at a point, $x$, the original sample is divided into subsets and the average minimum sample distance to $x$ over all such subsets is used to define the density estimate at $x$. The tuning parameter is thus the number of subsets instead of the typical bandwidth
Tenorio, Luis +2 more
openaire +4 more sources
Minimum orbital intersection distance: an asymptotic approach [PDF]
Astronomy & Astrophysics, 2019 The minimum orbital intersection distance (MOID) is used as a measure to assess potential close approaches and collision risks between astronomical objects. Methods to calculate this quantity have been proposed in several previous publications. The most frequent case is that in which both objects have elliptical osculating orbits.
J. M. Hedo +3 more
openaire +3 more sources
Minimum survivable graphs with bounded distance increase [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 We study in graphs properties related to fault-tolerance in case a node fails. A graph G is k-self-repairing, where k is a non-negative integer, if after the removal of any vertex no distance in the surviving graph increases by more than k. In the
Selma Djelloul, Mekkia Kouider
doaj +2 more sources
The [72,36] Type 11 Self Dual Codes from Hadamard Matrices
Davao Research Journal, 2001 Consider a code [n,k,d] of length n, dimension k and of minimum distance d. Let R be a rate defined by the equation R = k/n. Mathematically, the main problem of coding theory is to find codes with large R (for efficiency) and large d (to correct many ...
Rowena Baylon-Cabrizos
doaj +1 more source
Dihedral Codes with Prescribed Minimum Distance [PDF]
, 2021 Dihedral codes, particular cases of quasi-cyclic codes, have a nice algebraic structure which allows to store them efficiently. In this paper, we investigate it and prove some lower bounds on their dimension and minimum distance, in analogy with the theory of BCH codes. This allows us to construct dihedral codes with prescribed minimum distance. In the
Borello, Martino, Jamous, Abdelillah
openaire +4 more sources
A moment-distance hybrid method for estimating a mixture of two symmetric densities
Modern Stochastics: Theory and Applications, 2018 In clustering of high-dimensional data a variable selection is commonly applied to obtain an accurate grouping of the samples. For two-class problems this selection may be carried out by fitting a mixture distribution to each variable.
David Källberg +2 more
doaj +1 more source
Generalized minimum distance functions [PDF]
Journal of Algebraic Combinatorics, 2018 J. Algebraic Combin., to appear.
González-Sarabia, Manuel +3 more
openaire +2 more sources
Geoid, 2015 Wilayah pesisir dan lautan merupakan salah satu sumber daya alam yang mempunyai sifat yang kompleks dan dinamis karena pengaruh dari dua ekosistem, yaitu ekosistem lautan dan daratan.
Latri Wartika, Teguh Hariyanto
doaj +1 more source
Minimum distance-unbalancedness of trees [PDF]
Journal of Mathematical Chemistry, 2021 AbstractFor a graph G, and two distinct vertices u and v of G, let $$n_{G}(u,v)$$ n G ( u , v )
Kramer, Marie, Rautenbach, Dieter
openaire +2 more sources