Sciweavers

21342 search results - page 3798 / 4269
» A Structured Language Model
Sort
View
DALT
2005
Springer
15 years 10 months ago
Complete Axiomatizations of Finite Syntactic Epistemic States
An agent who bases his actions upon explicit logical formulae has at any given point in time a finite set of formulae he has computed. Closure or consistency conditions on this se...
Thomas Ågotnes, Michal Walicki
ESWS
2005
Springer
15 years 10 months ago
RDFSculpt: Managing RDF Schemas Under Set-Like Semantics
The Semantic Web is an extension of the current Web in which information is given well-defined meaning to support effective data discovery and integration. The RDF framework is a...
Zoi Kaoudi, Theodore Dalamagas, Timos K. Sellis
ICALP
2005
Springer
15 years 10 months ago
Completely Non-malleable Schemes
Abstract An encryption scheme is non-malleable if the adversary cannot transform a ciphertext into one of a related message under the given public key. Although providing a very st...
Marc Fischlin
ICALP
2005
Springer
15 years 10 months ago
On Steganographic Chosen Covertext Security
At TCC 2005, Backes and Cachin proposed a new and very strong notion of security for public key steganography: secrecy against adaptive chosen covertext attack (SS-CCA); and posed ...
Nicholas Hopper
ICFCA
2005
Springer
15 years 10 months ago
Conceptual Exploration of Semantic Mirrors
Abstract. The “Semantic Mirrors Method” (Dyvik, 1998) is a means for automatic derivation of thesaurus entries from a word-aligned parallel corpus. The method is based on the c...
Uta Priss, L. John Old
« Prev « First page 3798 / 4269 Last » Next »