Sciweavers

14774 search results - page 2630 / 2955
» Computational complexity and evolutionary computation
Sort
View
SIAMCOMP
2010
88views more  SIAMCOMP 2010»
15 years 2 months ago
Hardness Amplification Proofs Require Majority
Hardness amplification is the fundamental task of converting a -hard function f : {0, 1}n {0, 1} into a (1/2 - )-hard function Amp(f), where f is -hard if small circuits fail to c...
Ronen Shaltiel, Emanuele Viola
206
Voted
TCOM
2010
83views more  TCOM 2010»
15 years 2 months ago
Early-Elimination Modification for Priority-First Search Decoding
Abstract--In order to release the growing demand for computational complexity with respect to increasing information sequence length in the priority-first search decoding algorithm...
Shin-Lin Shieh, Po-Ning Chen, Yunghsiang S. Han, T...
TIP
2010
154views more  TIP 2010»
15 years 2 months ago
Efficient Fourier-Wavelet Super-Resolution
Super-resolution (SR) is the process of combining multiple aliased low-quality images to produce a high-resolution high-quality image. Aside from registration and fusion of low-res...
M. Dirk Robinson, Cynthia A. Toth, Joseph Y. Lo, S...
TIT
2010
102views Education» more  TIT 2010»
15 years 2 months ago
On instantaneous relaying
Abstract--The Gaussian, three-node relay channel with orthogonal receive components (i.e., the transmitted signals from the source and the relay do not interfere with each other) i...
Majid Nasiri Khormuji, Mikael Skoglund
TSP
2010
15 years 2 months ago
A nondata-aided SNR estimation technique for multilevel modulations exploiting signal cyclostationarity
Signal-to-noise ratio (SNR) estimators of linear modulation schemes usually operate at one sample per symbol at the matched filter output. In this paper we propose a new method for...
Jaume Riba, Javier Villares, Gregori Vázque...
« Prev « First page 2630 / 2955 Last » Next »