Results 31 to 40 of about 13,257,834 (322)
Lower bound theorems for general polytopes [PDF]
, 2019 For a $d$-dimensional polytope with $v$ vertices, $d+1\le v\le2d$, we calculate precisely the minimum possible number of $m$-dimensional faces, when $m=1$ or $m\ge0.62d$. This confirms a conjecture of Gr\"unbaum, for these values of $m$. For $v=2d+1$, we
Pineda-Villavicencio, Guillermo +2 more
core +3 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
Communication Lower Bound in Convolution Accelerators [PDF]
International Symposium on High-Performance Computer Architecture, 2019 In current convolutional neural network (CNN) accelerators, communication (i.e., memory access) dominates the energy consumption. This work provides comprehensive analysis and methodologies to minimize the communication for CNN accelerators.
Xiaoming Chen, Yinhe Han, Yu Wang
semanticscholar +1 more source
Damage Index-Based Lower Bound Structural Design
Frontiers in Built Environment, 2018 The scope of the work is to detect the most appropriate damage index, able to provide a reliable description of the structural damage level. This damage index is used to formulate a performance-based design framework to be used as a design tool for ...
Chara Ch. Mitropoulou +3 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
An improved lower bound for Folkman's theorem [PDF]
, 2017 Folkman's Theorem asserts that for each $k \in \mathbb{N}$, there exists a natural number $n = F(k)$ such that whenever the elements of $[n]$ are two-coloured, there exists a set $A \subset [n]$ of size $k$ with the property that all the sums of the form
Balogh, József +4 more
core +2 more sources
Lower bound of four-dimensional Hausdorff matrices
Journal of Inequalities and Applications, 2019 Let H=(hnmjk) $\mathsf{H}=(h_{nmjk})$ be a non-negative four-dimensional matrix. Denote by Lp(H) $L_{p}(\mathsf{H})$ the supremum of those ℓ satisfying the following inequality: (∑n=0∞∑m=0∞(∑j=0∞∑k=0∞hnmjkxj,k)p)1/p≥ℓ(∑j=0∞∑k=0∞xj,kp)1/p, $$ { \Biggl ...
Gholamreza Talebi
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
Differentiable Rigidity under Ricci curvature lower bound [PDF]
, 2010 In this article we prove a differentiable rigidity result. Let $(Y, g)$ and $(X, g_0)$ be two closed $n$-dimensional Riemannian manifolds ($n\geqslant 3$) and $f:Y\to X$ be a continuous map of degree $1$.
Bessières, Laurent +3 more
core +2 more sources
Lower Bound for Complete (k,n)-arc in PG(3,23) [PDF]
BIO Web of ConferencesIn this work, we construct a complete (k,n)-arcs in the projective space over Galois field GF(23), we construct the complete (k,n)-arcs by taking the union of some (k.n)-arcs, by using computer program we added some points of index zero, and found all ...
Juma'a Abd Ezalden Mohamed +1 more
doaj +1 more source