Sciweavers

3444 search results - page 546 / 689
» A Theory of Object-Oriented Design
Sort
View
ALT
2003
Springer
15 years 10 months ago
Can Learning in the Limit Be Done Efficiently?
Abstract. Inductive inference can be considered as one of the fundamental paradigms of algorithmic learning theory. We survey results recently obtained and show their impact to pot...
Thomas Zeugmann
ESOP
2000
Springer
15 years 10 months ago
Type Classes with Functional Dependencies
Abstract. Type classes in Haskell allow programmers to define functions that can be used on a set of different types, with a potentially different implementation in each case. For ...
Mark P. Jones
EUROCRYPT
2000
Springer
15 years 10 months ago
Authenticated Key Exchange Secure against Dictionary Attacks
Password-based protocols for authenticated key exchange (AKE) are designed to work despite the use of passwords drawn from a space so small that an adversary might well enumerate, ...
Mihir Bellare, David Pointcheval, Phillip Rogaway
PKC
2000
Springer
118views Cryptology» more  PKC 2000»
15 years 10 months ago
An Identification Scheme Based on Sparse Polynomials
This paper gives a new example of exploiting the idea of using polynomials with restricted coefficients over finite fields and rings to construct reliable cryptosystems and identif...
William D. Banks, Daniel Lieman, Igor Shparlinski
ZUM
2000
Springer
132views Formal Methods» more  ZUM 2000»
15 years 10 months ago
A Formal Architecture for the 3APL Agent Programming Language
Abstract. The notion of agents has provided a way of imbuing traditional computing systems with an extra degree of flexibility that allows them to be more resilient and robust in t...
Mark d'Inverno, Koen V. Hindriks, Michael Luck