Results 11 to 20 of about 3,023,466 (332)
Fingerprinting With Minimum Distance Decoding [PDF]
IEEE Transactions on Information Forensics and Security, 2009 26 pages, 6 figures, submitted to IEEE Transactions on Information Forensics and ...
Lin, Shih-Chun +2 more
openaire +4 more sources
On Minimum Maximal Distance-k Matchings [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 We study the computational complexity of several problems connected with finding a maximal distance-$k$ matching of minimum cardinality or minimum weight in a given graph. We introduce the class of $k$-equimatchable graphs which is an edge analogue of $k$
Yury Kartynnik, Andrew Ryzhikov
doaj +3 more sources
The minimum distance problem for two-way entanglement purification [PDF]
, 2006 Entanglement purification takes a number of noisy EPR pairs and processes them to produce a smaller number of more reliable pairs. If this is done with only a forward classical side channel, the procedure is equivalent to using a quantum error-correcting
Andris Ambainis, Daniel Gottesman
openalex +5 more sources
Frontiers in Oncology, 2023 PurposeDeep-learning effectively predicts dose distributions in knowledge-based radiotherapy planning. Using anatomical information that includes a structure map and computed tomography (CT) data as input has been proven to work well.
Xinyuan Chen +6 more
doaj +1 more source
DEGREE DISTANCE AND MINIMUM DEGREE [PDF]
Bulletin of the Australian Mathematical Society, 2012 AbstractLet G be a finite connected graph of order n, minimum degree δ and diameter d. The degree distance D′(G) of G is defined as ∑ {u,v}⊆V (G)(deg u+deg v) d(u,v), where deg w is the degree of vertex w and d(u,v) denotes the distance between u and v. In this paper, we find an asymptotically sharp upper bound on the degree distance in terms of order,
Mukwembi, S., Munyira, S.
openaire +2 more sources
Entropy, 2020 In this paper, we obtain upper bounds on the minimum distance for turbo codes using fourth degree permutation polynomial (4-PP) interleavers of a specific interleaver length and classical turbo codes of nominal 1/3 coding rate, with two recursive ...
Lucian Trifina +3 more
doaj +1 more source
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
Lattice polytopes in coding theory [PDF]
, 2014 In this paper we discuss combinatorial questions about lattice polytopes motivated by recent results on minimum distance estimation for toric codes. We also prove a new inductive bound for the minimum distance of generalized toric codes.
Soprunov, Ivan
core +5 more sources