Related papers: The square array design
The Alternating Direction Method of Multipliers (ADMM) has now days gained tremendous attentions for solving large-scale machine learning and signal processing problems due to the relative simplicity. However, the two-block structure of the…
The study of good nonregular fractional factorial designs has received significant attention over the last two decades. Recent research indicates that designs constructed from quaternary codes (QC) are very promising in this regard. The…
A $t\text{-}(n,k,\lambda;q)$-design is a set of $k$-subspaces, called blocks, of an $n$-dimensional vector space $V$ over the finite field with $q$ elements such that each $t$-subspace is contained in exactly $\lambda$ blocks. A partition…
Pseudo-geometric designs are combinatorial designs which share the same parameters as a finite geometry design, but which are not isomorphic to that design. As far as we know, many pseudo-geometric designs have been constructed by the…
We introduce a Bayesian extension of the latent block model for model-based block clustering of data matrices. Our approach considers a block model where block parameters may be integrated out. The result is a posterior defined over the…
In distributed storage systems built using commodity hardware, it is necessary to have data redundancy in order to ensure system reliability. In such systems, it is also often desirable to be able to quickly repair storage nodes that fail.…
In the field of quantum linear system algorithms, quantum computing has realized exponential computational advantages over classical computing. However, the focus has been on square coefficient matrices, with few quantum algorithms…
We present a unified deterministic approach for experimental design problems using the method of interlacing polynomials. Our framework recovers the best-known approximation guarantees for the well-studied D/A/E-design problems with simple…
Multidimensional scaling visualizes dissimilarities among objects and reduces data dimensionality. While many methods address symmetric proximity data, asymmetric and especially three-way proximity data (capturing relationships across…
We consider designs for cancer trials which allow each medical centre to treat only a limited number of cancer types with only a limited number of drugs. We specify desirable properties of these designs, and prove some consequences. Then we…
For reconstruction of low-rank matrices from undersampled measurements, we develop an iterative algorithm based on least-squares estimation. While the algorithm can be used for any low-rank matrix, it is also capable of exploiting a-priori…
A de Bruijn array code is a set of $r \times s$ binary doubly-periodic arrays such that each binary $n \times m$ matrix is contained exactly once as a window in one of the arrays. Such a set of arrays can be viewed as a two-dimensional…
Inspired by the "generalized t-designs" defined by Cameron [P. J. Cameron, A generalisation of t-designs, Discrete Math. 309 (2009), 4835--4842], we define a new class of combinatorial designs which simultaneously provide a generalization…
We introduce the notion of quasi-orthogonal cocycle. This is motivated in part by the maximal determinant problem for square $\{\pm 1\}$-matrices of size congruent to $2$ modulo $4$. Quasi-orthogonal cocycles are analogous to the orthogonal…
Complex survey data are usually collected following complex sampling designs. Accounting for the sampling design is essential to obtain unbiased estimates and valid inferences when analyzing complex survey data. The area under the receiver…
Mixed (asymmetric) orthogonal arrays (MOAs) generalize classical orthogonal arrays by allowing columns over different alphabets. However, their study requires very different structural tools than those used for symmetric orthogonal arrays…
We propose a randomized method for solving linear programs with a large number of columns but a relatively small number of constraints. Since enumerating all the columns is usually unrealistic, such linear programs are commonly solved by…
Unitary designs are essential tools in several quantum information protocols. Similarly to other design concepts, unitary designs are mainly used to facilitate averaging over a relevant space, in this case, the unitary group…
In this article, we present a novel approach for block-structured adaptive mesh refinement (AMR) that is suitable for extreme-scale parallelism. All data structures are designed such that the size of the meta data in each distributed…
In this work we present a new simple but efficient scheme - Subsquares approach - for development of algorithms for enclosing the solution set of overdetermined interval linear systems. We are going to show two algorithms based on this…