Sciweavers

658 search results - page 53 / 132
» Open problems in the security of learning
Sort
View
ALT
1997
Springer
14 years 2 months ago
Learning DFA from Simple Examples
Efficient learning of DFA is a challenging research problem in grammatical inference. It is known that both exact and approximate (in the PAC sense) identifiability of DFA is har...
Rajesh Parekh, Vasant Honavar
JMLR
2012
12 years 17 days ago
Distance Metric Learning with Eigenvalue Optimization
The main theme of this paper is to develop a novel eigenvalue optimization framework for learning a Mahalanobis metric. Within this context, we introduce a novel metric learning a...
Yiming Ying, Peng Li
DEBU
2007
131views more  DEBU 2007»
13 years 10 months ago
Future Trends in Secure Chip Data Management
Secure chips, e.g. present in smart cards, TPM, USB dongles are now ubiquitous in applications with strong security requirements. Secure chips host personal data that must be care...
Nicolas Anciaux, Luc Bouganim, Philippe Pucheral
COLT
2001
Springer
14 years 2 months ago
Tracking a Small Set of Experts by Mixing Past Posteriors
In this paper, we examine on-line learning problems in which the target concept is allowed to change over time. In each trial a master algorithm receives predictions from a large ...
Olivier Bousquet, Manfred K. Warmuth
WWW
2011
ACM
13 years 5 months ago
Learning to rank with multiple objective functions
We investigate the problem of learning to rank for document retrieval from the perspective of learning with multiple objective functions. We present solutions to two open problems...
Krysta Marie Svore, Maksims Volkovs, Christopher J...