Sciweavers

1403 search results - page 277 / 281
» Set cover algorithms for very large datasets
Sort
View
DLOG
2006
13 years 9 months ago
Tableau Caching for Description Logics with Inverse and Transitive Roles
Abstract. Modern description logic (DL) reasoners are known to be less efficient for DLs with inverse roles. The current loss of performance is largely due to the missing applicabi...
Yu Ding, Volker Haarslev
ENTCS
2007
87views more  ENTCS 2007»
13 years 8 months ago
A Study on the Practicality of Poly-Controlled Partial Evaluation
Poly-controlled partial evaluation (PCPE) is a flexible approach for specializing logic programs, which has been recently proposed. It takes into account repertoires of global co...
Claudio Ochoa, Germán Puebla
BMCBI
2004
208views more  BMCBI 2004»
13 years 8 months ago
Using 3D Hidden Markov Models that explicitly represent spatial coordinates to model and compare protein structures
Background: Hidden Markov Models (HMMs) have proven very useful in computational biology for such applications as sequence pattern matching, gene-finding, and structure prediction...
Vadim Alexandrov, Mark Gerstein
JOC
2000
181views more  JOC 2000»
13 years 8 months ago
Security Arguments for Digital Signatures and Blind Signatures
Abstract. Since the appearance of public-key cryptography in the seminal DiffieHellman paper, many new schemes have been proposed and many have been broken. Thus, the simple fact t...
David Pointcheval, Jacques Stern
JACM
2010
137views more  JACM 2010»
13 years 6 months ago
Reconciling description logics and rules
Description logics (DLs) and rules are formalisms that emphasize different aspects of knowledge representation: whereas DLs are focused on specifying and reasoning about conceptual...
Boris Motik, Riccardo Rosati