The notion of distance constrained graph labelings, motivated by the Frequency Assignment Problem, reads as follows: A mapping from the vertex set of a graph G = (V, E) into an in...
TheexactlikelihoodfunctionofaGaussianvectorautoregressive-movingaverage(VARMA)model is evaluated in two nonstandard cases: (a) a parsimonious structured form, such as obtained in ...
A biplane is a 2-(k(k - 1)/2 + 1, k, 2) symmetric design. Only sixteen nontrivial biplanes are known: there are exactly nine biplanes with k < 11, at least five biplanes with k...
Abstract. In this paper, we empirically investigate the NP-hard problem of finding sparsest solutions to linear equation systems, i.e., solutions with as few nonzeros as possible. ...
We put forward a new method of constructing Fiat-Shamir-like signature schemes that yields better "exact security" than the original Fiat-Shamir method. (We also point o...