20 results for “non-square UPAs”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
Yilong Liu, Xi Yang, Jing Xu, Jun Zhang +1 more
This paper investigates the performance impact of non-square uniform planar arrays (UPAs) on extremely large-scale multiple-input multiple-output (XL-MIMO) systems, deriving effective beamfocusing dis…
The paper shows that for non-planar orthogonal drawings of a graph, two drawings are sufficient instead of the planar case's three.
This paper presents methods for ranking and unranking permutations avoiding a pattern of length three in lexicographic or colexicographic order.
Cheng-Han Huang, Yongliang Sun, Chaoyan Huang, Ismail Alkhouri +1 more
The paper establishes conditions for QUBO formulations of combinatorial optimization problems that guarantee valid binary and feasible local minimizers using gradient-based methods.
The paper systematically studies the trade-offs between the number of slopes, bends per edge, and required area for planar drawings of bounded-degree graphs, providing new constructions for high-degre…
This paper introduces and implements variants of the symmetric lexicographic symmetric-subset reverse search framework for enumerating symmetric feasible subsets of a finite set, applying it to cocirc…
A simple online algorithm is presented for the stacking problem to avoid shifts with a sufficient condition involving stacking area dimension, load/unload points, and maximum items.
This paper settles the complexity of three sketching problems in graphs and distributions.
The paper proves XNLP-hardness of Directed Edge Geography and Undirected Edge Geography when parameterized by pathwidth, and shows their fixed-parameter tractability when parameterized by treewidth an…
The paper reveals that predictable nonce reuse by Polygon MEV searchers creates a critical vulnerability in ECDSA signatures, allowing passive attackers to recover private keys using linear algebra.
This paper derives multivariate generating functions to refine the enumeration of Fibonacci polyominoes.
This paper investigates the closeness of singularity for $n imes n$ unimodular matrices, specifically for $(2k+1)$-ary and $(k+1)$-ary cases of $4 imes 4$ nonnegative unimodular matrices.
The paper demonstrates that for FFT-based radar imaging on Apple Silicon, the limiting factor for half-precision (FP16) is dynamic range, not mantissa precision, and proposes a block-floating-point (B…
This paper studies the autarky problem of scheduling energy-consuming jobs with time windows using a battery and an energy forecast, and shows NP-hardness, polynomial-time solvability, and fixed-param…