1419 search results - page 10 / 284 » Notes on Formalizing Context |
132
click to vote
CRYPTO
2000
Springer
15 years 6 months ago
2000
Springer
Abstract. We present a lower bound on the number of rounds required by Concurrent Zero-Knowledge proofs for languages in NP. It is shown that in the context of Concurrent Zero-Know...
102
Voted
ACL
1998
15 years 3 months ago
1998
Since the early Sixties and Seventies it has been known that the regular and context-free languages arc characterized by definability in the monadic second-order theory of certain...
107
Voted
SEMCO
2007
IEEE
15 years 8 months ago
2007
IEEE
Most research in the field of anaphora or coreference detection has been limited to noun phrase coreference, usually on a restricted set of entities, such as ACE entities. In par...
101
click to vote
PUC
2007
15 years 1 months ago
2007
This paper describes the Mobile Fair Diary (MFD), which is designed to allow a housing fair customer to make a personalized digital recording of his/ her visit to a hectic fairgrou...
119
click to vote
FOSSACS
2005
Springer
15 years 8 months ago
2005
Springer
Nominal calculi have been shown very effective to formally model a variety of computational phenomena. The models of nominal calculi have often infinite states, thus making model ...