342 search results - page 60 / 69 » Tableau Algorithms for Description Logics |
112
Voted
TC
2008
15 years 9 days ago
2008
Since redundant number systems allow for constant time addition, they are often at the heart of modular multipliers designed for public key cryptography (PKC) applications. Indeed,...
102
Voted
SIAMCOMP
2000
15 years 5 days ago
2000
Abstract. We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and parti...
113
click to vote
ICALP
2009
Springer
16 years 20 days ago
2009
Springer
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
112
Voted
WWW
2004
ACM
16 years 1 months ago
2004
ACM
The paper describes some innovations related to the ongoing work on the GSA prototype, an integrated information retrieval agent. In order to improve the original system effective...
194
Voted
POPL
2008
ACM
16 years 21 days ago
2008
ACM
Contracts are behavioural descriptions of Web services. We devise a theory of contracts that formalises the compatibility of a client to a service, and the safe replacement of a s...