Sciweavers

2446 search results - page 92 / 490
» Where am I
Sort
View
ALT
2006
Springer
14 years 7 months ago
The Complexity of Learning SUBSEQ (A)
Higman showed that if A is any language then SUBSEQ(A) is regular, where SUBSEQ(A) is the language of all subsequences of strings in A. We consider the following inductive inferenc...
Stephen A. Fenner, William I. Gasarch
LICS
2003
IEEE
14 years 3 months ago
Spectra of Monadic Second-Order Formulas with One Unary Function
We establish the eventual periodicity of the spectrum of any monadic second-order formula where (i) all relation symbols, except equality, are unary, and (ii) there is only one fu...
Yuri Gurevich, Saharon Shelah
AH
2000
Springer
14 years 2 months ago
Layered Evaluation of Adaptive Applications and Services
In this paper we present an empirical study of the InterBook system to demonstrate the benefits of the layered evaluation framework, where the success of adaptation is addressed at...
Charalampos Karagiannidis, Demetrios G. Sampson
CRYPTO
2008
Springer
107views Cryptology» more  CRYPTO 2008»
13 years 11 months ago
Circular-Secure Encryption from Decision Diffie-Hellman
We describe a public-key encryption system that remains secure even encrypting messages that depend on the secret keys in use. In particular, it remains secure under a "key cy...
Dan Boneh, Shai Halevi, Michael Hamburg, Rafail Os...
IPCO
2004
94views Optimization» more  IPCO 2004»
13 years 11 months ago
More on a Binary-Encoded Coloring Formulation
We further develop the 0/1 ILP formulation of Lee for edge coloring where colors are encoded in binary. With respect to that formulation, our main contributions are: (i) an efficie...
Jon Lee, François Margot