Sciweavers

995 search results - page 39 / 199
» complexity 2011
Sort
View
ICASSP
2011
IEEE
14 years 6 months ago
On the implementation of MIMO-OFDM schemes using perturbation of the QR decomposition: Application to 3GPP LTE-a systems
Consider a flat-fading Multiple-Input Multiple-Output (MIMO) system. The near-optimum detection problematic has been shown to be efficiently solved through QR Decomposition (QRD...
Sébastien Aubert, Jane Tournois, Fabienne N...
IACR
2011
252views more  IACR 2011»
14 years 2 months ago
A Meet-in-the-Middle Attack on the Full KASUMI
KASUMI is a block cipher which consists eight Feistel rounds with a 128-bit key. The confidentiality and integrity of UMTS, GSM and GPRS mobile communications systems depend heavi...
Keting Jia, Hongbo Yu, Xiaoyun Wang
139
Voted
PRL
2011
14 years 10 months ago
Efficient approximate Regularized Least Squares by Toeplitz matrix
Machine Learning based on the Regularized Least Square (RLS) model requires one to solve a system of linear equations. Direct-solution methods exhibit predictable complexity and s...
Sergio Decherchi, Paolo Gastaldo, Rodolfo Zunino
COMPGEOM
2011
ACM
14 years 6 months ago
Zigzag persistent homology in matrix multiplication time
We present a new algorithm for computing zigzag persistent homology, an algebraic structure which encodes changes to homology groups of a simplicial complex over a sequence of sim...
Nikola Milosavljevic, Dmitriy Morozov, Primoz Skra...
IANDC
2011
84views more  IANDC 2011»
14 years 10 months ago
Teaching randomized learners with feedback
The present paper introduces a new model for teaching randomized learners. Our new model, though based on the classical teaching dimension model, allows to study the influence of...
Frank J. Balbach, Thomas Zeugmann