Sciweavers

1477 search results - page 102 / 296
» Complexity of (iterated) dominance
Sort
View
PAMI
2008
139views more  PAMI 2008»
15 years 6 months ago
A Fast Algorithm for Learning a Ranking Function from Large-Scale Data Sets
We consider the problem of learning a ranking function that maximizes a generalization of the Wilcoxon-Mann-Whitney statistic on the training data. Relying on an -accurate approxim...
Vikas C. Raykar, Ramani Duraiswami, Balaji Krishna...
TIT
2010
124views Education» more  TIT 2010»
15 years 1 months ago
Soft-input soft-output single tree-search sphere decoding
Soft-input soft-output (SISO) detection algorithms form the basis for iterative decoding. The computational complexity of SISO detection often poses significant challenges for prac...
Christoph Studer, Helmut Bölcskei
ICASSP
2011
IEEE
14 years 10 months ago
Latency-constrained low-complexity lattice reduction for MIMO-OFDM systems
Recent studies have investigated lattice-reduction (LR) preprocessing technique for multiple-inputmultiple-output (MIMO) detection. However, if LR is applied to the orthogonalfreq...
Chun-Fu Liao, Fang-Chun Lan, Yuan-Hao Huang, Po-Li...
ICC
2007
IEEE
120views Communications» more  ICC 2007»
16 years 21 days 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
16 years 13 days 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