Abstract. The worst-case complexity of an implementation of Quicksort depends on the random number generator that is used to select the pivot elements. In this paper we estimate th...
The fundamental problem for inference control in data cubes is how to efficiently calculate the lower and upper bounds for each cell value given the aggregations of cell values ove...
We initiate a direction for proving lower bounds on the size of non-commutative arithmetic circuits. This direction is based on a connection between lower bounds on the size of no...
—In this paper, we investigate the effects of imperfect knowledge of the channel covariance matrix on the performance of a linear minimum mean-square-error (MMSE) estimator for m...
Antonio Assalini, Emiliano Dall'Anese, Silvano Pup...
The estimation of a sparse vector in the linear model is a fundamental problem in signal processing, statistics, and compressive sensing. This paper establishes a lower bound on t...