Sciweavers

4714 search results - page 237 / 943
» The Complexity of Iterated Multiplication
Sort
View
PAMI
2008
139views more  PAMI 2008»
15 years 4 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»
14 years 11 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 8 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
2009
IEEE
160views Communications» more  ICC 2009»
15 years 11 months ago
Application of Phase Shift in Coherent Multi-Relay MIMO Communications
—In this paper we propose a new low feedback and low complexity scheme that adjusts the phases at the relays, thus allowing for the coherent combining of signals from multiple re...
Yi Zheng, Hani Mehrpouyan, Steven D. Blostein
CRYPTO
2001
Springer
95views Cryptology» more  CRYPTO 2001»
15 years 9 months ago
Robustness for Free in Unconditional Multi-party Computation
We present a very efficient multi-party computation protocol unconditionally secure against an active adversary. The security is maximal, i.e., active corruption of up to t < n/...
Martin Hirt, Ueli M. Maurer