Sciweavers

1192 search results - page 41 / 239
» Computing Weakest Readings
Sort
View
ASIACRYPT
2006
Springer
15 years 3 months ago
Relationship Between Standard Model Plaintext Awareness and Message Hiding
Abstract. Recently, Bellare and Palacio succeeded in defining the plaintext awareness, which is also called PA2, in the standard model. They propose three valiants of the standard ...
Isamu Teranishi, Wakaha Ogata
ACL
1997
15 years 1 months ago
A Theory of Parallelism and the Case of VP Ellipsis
We provide a general account of parallelism in discourse, and apply it to the special case of resolving possible readings for instances of VP ellipsis. We show how several problem...
Jerry R. Hobbs, Andrew Kehler
OPODIS
2010
14 years 9 months ago
Failure Detectors Encapsulate Fairness
Failure detectors are commonly viewed as abstractions for the synchronism present in distributed system models. However, investigations into the exact amount of synchronism encapsu...
Scott M. Pike, Srikanth Sastry, Jennifer L. Welch
ACL
2008
15 years 1 months ago
Regular Tree Grammars as a Formalism for Scope Underspecification
We propose the use of regular tree grammars (RTGs) as a formalism for the underspecified processing of scope ambiguities. By applying standard results on RTGs, we obtain a novel a...
Alexander Koller, Michaela Regneri, Stefan Thater
IPPS
2009
IEEE
15 years 6 months ago
The Weak Mutual Exclusion problem
In this paper we define the Weak Mutual Exclusion (WME) problem. Analogously to classical Distributed Mutual Exclusion (DME), WME serializes the accesses to a shared resource. Di...
Paolo Romano, Luís Rodrigues, Nuno Carvalho