We consider the problem of computing the k-sparse approximation to the discrete Fourier transform of an ndimensional signal. We show: • An O(k log n)-time randomized algorithm f...
Haitham Hassanieh, Piotr Indyk, Dina Katabi, Eric ...
Optimizing queries that involve operations on spatial data requires estimating the selectivity and cost of these operations. In this paper, we focus on estimating the cost of spat...
: A research topic that has been receiving much interest recently is the reconstruction of a high resolution image from an ensemble of low resolution images of the same scene. Such...
In this paper we revisit the minimum mean square error (MMSE) pilot-aided channel estimation for broadband orthogonal frequency division multiplexing (OFDM) systems. The careful de...
In many pattern recognition applications, high-dimensional feature vectors impose a high computational cost as well as the risk of "overfitting". Feature Selection addre...