Sciweavers

658 search results - page 65 / 132
» Open problems in the security of learning
Sort
View
115
Voted
AAAI
1998
15 years 4 months ago
Boosting in the Limit: Maximizing the Margin of Learned Ensembles
The "minimum margin" of an ensemble classifier on a given training set is, roughly speaking, the smallest vote it gives to any correct training label. Recent work has sh...
Adam J. Grove, Dale Schuurmans
114
Voted
INFOCOM
2006
IEEE
15 years 9 months ago
Self-Learning Collision Avoidance for Wireless Networks
— The limited number of orthogonal channels and the autonomous installations of hotspots and home wireless networks often leave neighboring 802.11 basic service sets (BSS’s) op...
Chun-cheng Chen, Eunsoo Seo, Hwangnam Kim, Haiyun ...
109
Voted
COLT
2008
Springer
15 years 5 months ago
High-Probability Regret Bounds for Bandit Online Linear Optimization
We present a modification of the algorithm of Dani et al. [8] for the online linear optimization problem in the bandit setting, which with high probability has regret at most O ( ...
Peter L. Bartlett, Varsha Dani, Thomas P. Hayes, S...
120
Voted
CCS
2005
ACM
15 years 9 months ago
Keyboard acoustic emanations revisited
We examine the problem of keyboard acoustic emanations. We present a novel attack taking as input a 10-minute sound recording of a user typing English text using a keyboard, and t...
Li Zhuang, Feng Zhou, J. D. Tygar
122
Voted
FC
2009
Springer
134views Cryptology» more  FC 2009»
15 years 10 months ago
Cryptographic Combinatorial Securities Exchanges
Abstract. We present a useful new mechanism that facilitates the atomic exchange of many large baskets of securities in a combinatorial exchange. Cryptography prevents information ...
Christopher Thorpe, David C. Parkes