Abstract— In [1], we have recently proposed a general approach for approximating the power sum of Log–Normal Random Variables (RVs) by using the Pearson system of distributions...
Marco Di Renzo, Fabio Graziosi, Fortunato Santucci
The AND problem on t bits is a promise decision problem where either at most one bit of the input is set to 1 (NO instance) or all t bits are set to 1 (YES instance). In this note...
Krylov-subspace based methods for generating low-order models of complicated interconnect are extremely effective, but there is no optimality theory for the resulting models. Alte...
The design guideline avoid dependency cycles among modules was first alluded to by Parnas in 1978. Many tools have since been built to detect cyclic dependencies among a program...
Background: During the last few years, DNA sequence analysis has become one of the primary means of taxonomic identification of species, particularly so for species that are minut...
R. Henrik Nilsson, Erik Kristiansson, Martin Ryber...