Properties of Complete Sets of Mutually Equiorthogonal Frequency Hypercubes
, 1997 A complete set of mutually equiorthogonal frequency hypercubes (MEFH) of ordern and dimensiond, usingm distinct symbols, has (n−1) d /(m−1) hypercubes. In this article, we explore the properties of complete sets of MEFH.
Morgan, Ilene H.
core +1 more source
On the classification of nonsingular 2x2x2x2 hypercubes
, 2013 As a first step in the classification of nonsingular 2x2x2x2 hypercubes up to equivalence, we resolve the case where the base field is finite and the hypercubes can be written as a product of two 2x2x2 hypercubes.
Coolsaet, Kris, Kris Coolsaet
core +1 more source
Distributed Computing on Oriented Anonymous Hypercubes with Faulty Components ∗
, 2008 We give efficient algorithms for distributed computation on anonymous, labeled, asynchronous oriented hypercubes with possible faulty components (i.e. processors and links) and deterministic processors. Initially, the processors know only the size of the
Evangelos Kranakis, Nicola Santoro
core
Affine Geometries and Sets of Equiorthogonal Frequency Hypercubes
, 2000 Equiorthogonal frequency hypercubes are one particular generalization of orthogonal latin squares. a complete set of mutually equiorthogonal frequency hypercubes (MEFH) of order n and dimension d, using m distinct symbols, has (n − 1)d/(m − 1) hypercubes.
Morgan, Ilene H.
core +1 more source
The geometry of robustness in spiking neural networks. [PDF]
Elife, 2022 Calaim N +3 more
europepmc +1 more source
A Pseudo-Boolean Solution to the Maximum Quartet Consistency Problem
, 2008 Determining the evolutionary history of a given biological data is an important task in biological sciences. Given a set of quartet topologies over a set of taxa, the Maximum Quartet Consistency (MQC) problem consists of computing a global phylogeny that
Morgado, Antonio Jose +1 more
core +1 more source
Translating Pseudo-Boolean Constraints into SAT
, 2005 In this paper, we describe and evaluate three different techniques for translating pseudo-boolean constraints (linear constraints over boolean variables) intoclauses that can be handled by a standard SAT-solver.
Een, Niklas,, Sörensson, Niklas,
core
Mapping the International Geopolitical Agenda: Still National Conceptions of the Emerging European Crisi. [PDF]
Front Big Data, 2021 Grasland C +3 more
europepmc +1 more source
Computational Verification of Large Logical Models-Application to the Prediction of T Cell Response to Checkpoint Inhibitors. [PDF]
Front Physiol, 2020 Hernandez C +3 more
europepmc +1 more source
Optimal Dynamic Embeddings of Complete Binary Trees into Hypercubes
, 1998 The double-rooted complete binary tree is a complete binary tree where the root is replaced by an edge. It is folklore that the double-rooted complete binary tree is a spanning tree of the hypercube of the same size. Unfortunately, the usual construction
Ernst W. Mayr +2 more
core