Sciweavers

2996 search results - page 441 / 600
» Numberings and Randomness
Sort
View
CISS
2008
IEEE
16 years 1 months ago
Near optimal lossy source coding and compression-based denoising via Markov chain Monte Carlo
— We propose an implementable new universal lossy source coding algorithm. The new algorithm utilizes two wellknown tools from statistical physics and computer science: Gibbs sam...
Shirin Jalali, Tsachy Weissman
FOCS
2008
IEEE
16 years 1 months ago
Lower Bounds for Noisy Wireless Networks using Sampling Algorithms
We show a tight lower bound of Ω(N log log N) on the number of transmissions required to compute several functions (including the parity function and the majority function) in a...
Chinmoy Dutta, Jaikumar Radhakrishnan
GLOBECOM
2008
IEEE
16 years 1 months ago
Interference Reduction by Beamforming in Cognitive Networks
— We consider beamforming in a cognitive network with multiple primary users and secondary users sharing the same spectrum. In particular, we assume that each secondary transmitt...
Simon Yiu, Mai Vu, Vahid Tarokh
GLOBECOM
2008
IEEE
16 years 1 months ago
A Memory-Optimized Bloom Filter Using an Additional Hashing Function
— A Bloom filter is a simple space-efficient randomized data structure for the representation set of items in order to support membership queries. In recent years, Bloom filte...
Mahmood Ahmadi, Stephan Wong
ICASSP
2008
IEEE
16 years 1 months ago
Wavelet-domain compressive signal reconstruction using a Hidden Markov Tree model
Compressive sensing aims to recover a sparse or compressible signal from a small set of projections onto random vectors; conventional solutions involve linear programming or greed...
Marco F. Duarte, Michael B. Wakin, Richard G. Bara...