Sciweavers

5138 search results - page 383 / 1028
» Randomized Algorithms for 3-SAT
Sort
View
ECCC
2010
122views more  ECCC 2010»
15 years 5 months ago
Query Complexity Lower Bounds for Reconstruction of Codes
We investigate the problem of local reconstruction, as defined by Saks and Seshadhri (2008), in the context of error correcting codes. The first problem we address is that of me...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah
CISS
2008
IEEE
16 years 1 months ago
Distributed estimation in wireless sensor networks via variational message passing
Abstract – In this paper, a variational message passing framework is proposed for Markov random fields. Analogous to the traditional belief propagation algorithm, variational mes...
Yanbing Zhang, Huaiyu Dai
ICASSP
2008
IEEE
16 years 1 months ago
A compressive beamforming method
Compressive Sensing (CS) is an emerging area which uses a relatively small number of non-traditional samples in the form of randomized projections to reconstruct sparse or compres...
Ali Cafer Gurbuz, James H. McClellan, Volkan Cevhe...
ICC
2007
IEEE
104views Communications» more  ICC 2007»
16 years 1 months ago
Semiblind Carrier Frequency Offset Estimation for OFDM Systems
— In this paper we consider the problem of semiblind carrier frequency offset (CFO) estimation for OFDM systems. Specifically, we consider a synchronization scheme based on the ...
Tilde Fusco, Ferdinando Marrone, Mario Tanda
AI
2005
Springer
16 years 8 days ago
Comparing Dimension Reduction Techniques for Document Clustering
In this research, a systematic study is conducted of four dimension reduction techniques for the text clustering problem, using five benchmark data sets. Of the four methods -- Ind...
Bin Tang, Michael A. Shepherd, Malcolm I. Heywood,...