Sciweavers

1132 search results - page 61 / 227
» Upper and lower Ramsey bounds in bounded arithmetic
Sort
View
COCOON
2005
Springer
15 years 5 months ago
Randomized Quicksort and the Entropy of the Random Source
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...
Beatrice List, Markus Maucher, Uwe Schöning, ...
TDSC
2008
116views more  TDSC 2008»
14 years 11 months ago
Practical Inference Control for Data Cubes
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...
Haibing Lu, Yingjiu Li
STOC
2010
ACM
168views Algorithms» more  STOC 2010»
15 years 9 months ago
Non-commutative circuits and the sum-of-squares problem
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...
Pavel Hrubes, Avi Wigderson and Amir Yehudayoff
ICC
2009
IEEE
161views Communications» more  ICC 2009»
15 years 6 months ago
Linear MMSE MIMO Channel Estimation with Imperfect Channel Covariance Information
—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...
CORR
2011
Springer
148views Education» more  CORR 2011»
14 years 6 months ago
How well can we estimate a sparse vector?
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...
Emmanuel J. Candès, Mark A. Davenport