Sciweavers

1791 search results - page 156 / 359
» Semantics and Complexity of SPARQL
Sort
View
DLOG
2001
15 years 6 months ago
Preserving Modularity in XML Encoding of Description Logics
Description logics have been designed and studied in a modular way. This has allowed a methodic approach to complexity evaluation. We present a way to preserve this modularity in ...
Jérôme Euzenat
CORR
2012
Springer
214views Education» more  CORR 2012»
14 years 20 days ago
Sum-Product Networks: A New Deep Architecture
The key limiting factor in graphical model inference and learning is the complexity of the partition function. We thus ask the question: what are the most general conditions under...
Hoifung Poon, Pedro Domingos
ACL
2012
13 years 7 months ago
Learning High-Level Planning from Text
Comprehending action preconditions and effects is an essential step in modeling the dynamics of the world. In this paper, we express the semantics of precondition relations extrac...
S. R. K. Branavan, Nate Kushman, Tao Lei, Regina B...
EUROCRYPT
2012
Springer
13 years 7 months ago
Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
We describe a compression technique that reduces the public key size of van Dijk, Gentry, Halevi and Vaikuntanathan’s (DGHV) fully homomorphic scheme over the integers from ËœO(Î...
Jean-Sébastien Coron, David Naccache, Mehdi...
139
Voted
WWW
2005
ACM
16 years 5 months ago
Composite event queries for reactivity on the web
Reactivity on the Web is an emerging issue. The capability to automatically react to events (such as updates to Web resources) is essential for both Web services and Semantic Web ...
François Bry, James Bailey, Paula-Lavinia P...