Sciweavers

107 search results - page 4 / 22
» A Simple Algorithm for Ordering and Compression of Vector Co...
Sort
View
CORR
2011
Springer
198views Education» more  CORR 2011»
13 years 2 months ago
Pattern matching in Lempel-Ziv compressed strings: fast, simple, and deterministic
Countless variants of the Lempel-Ziv compression are widely used in many real-life applications. This paper is concerned with a natural modification of the classical pattern match...
Pawel Gawrychowski
ICASSP
2009
IEEE
14 years 2 months ago
Compressive sensing for sparsely excited speech signals
Compressive sensing (CS) has been proposed for signals with sparsity in a linear transform domain. We explore a signal dependent unknown linear transform, namely the impulse respo...
Thippur V. Sreenivas, W. Bastiaan Kleijn
CORR
2007
Springer
92views Education» more  CORR 2007»
13 years 7 months ago
Bit-Interleaved Coded Multiple Beamforming with Imperfect CSIT
This paper addresses the performance of bit-interleaved coded multiple beamforming (BICMB) [1], [2] with imperfect knowledge of beamforming vectors. Most studies for limited-rate ...
Ersin Sengul, Ender Ayanoglu
SODA
2012
ACM
209views Algorithms» more  SODA 2012»
11 years 9 months ago
Simple and practical algorithm for sparse Fourier transform
We consider the sparse Fourier transform problem: given a complex vector x of length n, and a parameter k, estimate the k largest (in magnitude) coefficients of the Fourier transf...
Haitham Hassanieh, Piotr Indyk, Dina Katabi, Eric ...
ICDE
2010
IEEE
183views Database» more  ICDE 2010»
14 years 2 months ago
Estimating the compression fraction of an index using sampling
—Data compression techniques such as null suppression and dictionary compression are commonly used in today’s database systems. In order to effectively leverage compression, it...
Stratos Idreos, Raghav Kaushik, Vivek R. Narasayya...