Sciweavers

2957 search results - page 327 / 592
» The Complexity of Polynomial-Time Approximation
Sort
View
ICCV
2009
IEEE
15 years 4 months ago
Kernel map compression using generalized radial basis functions
The use of Mercer kernel methods in statistical learning theory provides for strong learning capabilities, as seen in kernel principal component analysis and support vector machin...
Omar Arif, Patricio A. Vela
ICISC
2009
163views Cryptology» more  ICISC 2009»
15 years 4 months ago
Improved Linear Cryptanalysis of SOSEMANUK
The SOSEMANUK stream cipher is one of the finalists of the eSTREAM project. In this paper, we improve the linear cryptanalysis of SOSEMANUK presented in Asiacrypt 2008. We apply th...
Joo Yeon Cho, Miia Hermelin
AUTOMATICA
2011
15 years 1 months ago
A frequentist approach to mapping under uncertainty
An asynchronous stochastic approximation based (Frequentist) approach is proposed for mapping using noisy mobile sensors under two different scenarios: 1) perfectly known sensor ...
Suman Chakravorty, R. Saha
CDC
2010
IEEE
139views Control Systems» more  CDC 2010»
15 years 1 months ago
An adaptive-covariance-rank algorithm for the unscented Kalman filter
Abstract-- The Unscented Kalman Filter (UKF) is a nonlinear estimator that is particularly well suited for complex nonlinear systems. In the UKF, the error covariance is estimated ...
Lauren E. Padilla, Clarence W. Rowley
CORR
2011
Springer
185views Education» more  CORR 2011»
15 years 1 months ago
Asymptotic Moments for Interference Mitigation in Correlated Fading Channels
Abstract—We consider a certain class of large random matrices, composed of independent column vectors with zero mean and different covariance matrices, and derive asymptotically ...
Jakob Hoydis, Mérouane Debbah, Mari Kobayas...