Sciweavers

4714 search results - page 238 / 943
» The Complexity of Iterated Multiplication
Sort
View
153
Voted
ICC
2007
IEEE
120views Communications» more  ICC 2007»
15 years 11 months ago
Turbo Equalization for Clipped and Filtered COFDM Signals
— Clipping and filtering is an attractive method for the reduction of the PAPR of OFDM signals before transmission. However, the resulting in-band distortion noise impacts the e...
Peter Zillmann, Wolfgang Rave, Gerhard Fettweis
GLOBECOM
2006
IEEE
15 years 11 months ago
An Adaptive-Scaling Tone Reservation Algorithm for PAR Reduction in OFDM Systems
— Existing tone-reservation algorithms (such as the controlled clipper algorithm) for OFDM require a number of iterations to ensure the reduction of Peak-to-Average Power Ratio (...
Luqing Wang, Chintha Tellambura
SEKE
2004
Springer
15 years 10 months ago
Application Semiotics Engineering Process
As application semantics becomes more complex and dynamic in IT systems, it is necessary to engineer the application semantics in its own lifecycle of development parallel to syste...
Gang Zhao
NIPS
2004
15 years 6 months ago
VDCBPI: an Approximate Scalable Algorithm for Large POMDPs
Existing algorithms for discrete partially observable Markov decision processes can at best solve problems of a few thousand states due to two important sources of intractability:...
Pascal Poupart, Craig Boutilier
122
Voted
SIAMJO
2008
93views more  SIAMJO 2008»
15 years 4 months ago
Smooth Optimization with Approximate Gradient
We show that the optimal complexity of Nesterov's smooth first-order optimization algorithm is preserved when the gradient is only computed up to a small, uniformly bounded er...
Alexandre d'Aspremont