Sciweavers

1790 search results - page 96 / 358
» Noise in Bilinear Problems
Sort
View
PAKDD
2000
ACM
100views Data Mining» more  PAKDD 2000»
14 years 23 days ago
Discovery of Relevant Weights by Minimizing Cross-Validation Error
In order to discover relevant weights of neural networks, this paper proposes a novel method to learn a distinct squared penalty factor for each weight as a minimization problem ov...
Kazumi Saito, Ryohei Nakano
TSP
2008
94views more  TSP 2008»
13 years 9 months ago
Oblique Projections for Direction-of-Arrival Estimation With Prior Knowledge
Estimation of Directions-Of-Arrival (DOA) is an important problem in various applications and a priori knowledge on the source location is sometimes available. To exploit this inf...
Rémy Boyer, Guillaume Bouleux
RFIDSEC
2010
13 years 7 months ago
Tree-Based RFID Authentication Protocols Are Definitively Not Privacy-Friendly
Authentication for low-cost Radio-Frequency IDentification (RFID) is a booming research topic. The challenge is to develop secure protocols using lightweight cryptography, yet ensu...
Gildas Avoine, Benjamin Martin 0002, Tania Martin
JMLR
2010
82views more  JMLR 2010»
13 years 4 months ago
Negative Results for Active Learning with Convex Losses
We study the problem of active learning with convex loss functions. We prove that even under bounded noise constraints, the minimax rates for proper active learning are often no b...
Steve Hanneke, Liu Yang
ICASSP
2011
IEEE
13 years 28 days ago
Lorentzian based iterative hard thresholding for compressed sensing
In this paper we propose a robust iterative hard thresolding (IHT) algorithm for reconstructing sparse signals in the presence of impulsive noise. To address this problem, we use ...
Rafael E. Carrillo, Kenneth E. Barner