Results 21 to 30 of about 1,085,519 (269)
Average Rate Analysis of Cooperative NOMA Aided Underwater Optical Wireless Systems
IEEE Open Journal of the Communications Society, 2021 In this paper, we consider a cooperative non-orthogonal multiple access (NOMA) aided underwater optical wireless system in which the source transmits to two users where the near user serves as a relay node to the far user. Our proposed system consists of
Kapila W. S. Palitharathna +4 more
doaj +1 more source
Treewidth Lower Bounds with Brambles [PDF]
Algorithmica, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hans L. Bodlaender +2 more
openaire +5 more sources
A Lower Bound for Scheduling Mechanisms [PDF]
Algorithmica, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
George Christodoulou 0001 +2 more
openaire +7 more sources
Projection Uniformity of Asymmetric Fractional Factorials
Axioms, 2022 The objective of this paper is to study the issue of the projection uniformity of asymmetric fractional factorials. On the basis of level permutation and mixture discrepancy, the average projection mixture discrepancy to measure the uniformity for low ...
Kang Wang, Zujun Ou, Hong Qin, Na Zou
doaj +1 more source
A Column Generation-Based Lower Bound for the Minimum Sum Coloring Problem
IEEE Access, 2020 The objective of this paper is to derive a tight and efficient lower bound for the minimum sum coloring problem. This NP-hard problem is a variant of the classical graph coloring problem where the objective is to minimize the sum of the colors.
Mehdi Mrad +3 more
doaj +1 more source
, 2015 Distance upper-bounding DUB allows a verifier to know whether a proving party is located within a certain distance bound. DUB protocols have many applications in secure authentication and location based services. We consider the dual problem of distance lower bounding DLB, where the prover proves it is outside a distance bound to the verifier.
Xifan Zheng +2 more
openaire +2 more sources
Maximum common subgraph: some upper bound and lower bound results
BMC Bioinformatics, 2006 Background Structure matching plays an important part in understanding the functional role of biological structures. Bioinformatics assists in this effort by reformulating this process into a problem of finding a maximum common subgraph between graphical
Jennings Steven F +2 more
doaj +1 more source
Construction of Dual Optimal Bidirectional Double-Loop Networks for Optimal Routing
Mathematics, 2022 Bidirectional double-loop networks (BDLNs) are widely used in computer networks for their simplicity, symmetry and scalability. One common way to improve their performance is to decrease the diameter and average distance.
Hui Liu, Xiaowan Li, Shenling Wang
doaj +1 more source
On the lower bound of Spearman’s footrule
Dependence Modeling, 2019 Úbeda-Flores showed that the range of multivariate Spearman’s footrule for copulas of dimension d ≥ 2 is contained in the interval [−1/d, 1], that the upper bound is attained exclusively by the upper Fréchet-Hoeffding bound, and that the lower bound is ...
Fuchs Sebastian, McCord Yann
doaj +1 more source
TURBO: The Swiss Knife of Auto-Encoders
Entropy, 2023 We present a novel information-theoretic framework, termed as TURBO, designed to systematically analyse and generalise auto-encoding methods. We start by examining the principles of information bottleneck and bottleneck-based networks in the auto ...
Guillaume Quétant +3 more
doaj +1 more source