Sciweavers

658 search results - page 28 / 132
» Open problems in the security of learning
Sort
View
ECCC
2008
98views more  ECCC 2008»
13 years 9 months ago
Public-Key Cryptosystems from the Worst-Case Shortest Vector Problem
We construct public-key cryptosystems that are secure assuming the worst-case hardness of approximating the minimum distance on n-dimensional lattices to within small poly(n) fact...
Chris Peikert
IUI
2005
ACM
14 years 2 months ago
Active preference learning for personalized calendar scheduling assistance
We present PLIANT, a learning system that supports adaptive assistance in an open calendaring system. PLIANT learns user preferences from the feedback that naturally occurs during...
Melinda T. Gervasio, Michael D. Moffitt, Martha E....
AGENTS
2001
Springer
14 years 1 months ago
Using background knowledge to speed reinforcement learning in physical agents
This paper describes Icarus, an agent architecture that embeds a hierarchical reinforcement learning algorithm within a language for specifying agent behavior. An Icarus program e...
Daniel G. Shapiro, Pat Langley, Ross D. Shachter
WWW
2009
ACM
14 years 3 months ago
Near real time information mining in multilingual news
This paper presents a near real-time multilingual news monitoring and analysis system that forms the backbone of our research work. The system integrates technologies to address t...
Martin Atkinson, Erik Van der Goot
PKC
2012
Springer
255views Cryptology» more  PKC 2012»
11 years 11 months ago
Strongly Secure Authenticated Key Exchange from Factoring, Codes, and Lattices
Abstract. An unresolved problem in research on authenticated key exchange (AKE) is to construct a secure protocol against advanced attacks such as key compromise impersonation and ...
Atsushi Fujioka, Koutarou Suzuki, Keita Xagawa, Ka...