98 search results - page 5 / 20 » Efficient Inference Control for Open Relational Queries |
STACS
2000
Springer
13 years 11 months ago
2000
Springer
We investigate self-testing programs with relative error by allowing error terms proportional to the function to be computed. Until now, in numerical computation, error terms were ...
WWW
2005
ACM
14 years 8 months ago
2005
ACM
We investigate the idea of finding semantically related search engine queries based on their temporal correlation; in other words, we infer that two queries are related if their p...
PADL
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. Ontologies and rules are usually loosely coupled in knowledge representation formalisms. In fact, ontologies use open-world reasoning while the leading semantics for rule...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Ontologies and rules are usually loosely coupled in knowledge representation formalisms. In fact, ontologies use open-world reasoning while the leading semantics for rules use non...
DNIS
2010
Springer
13 years 11 months ago
2010
Springer
Access control for relational databases is a well researched area. An SQL query is allowed or denied access to database according to the specified access control policy. On the oth...