Sciweavers

2917 search results - page 309 / 584
» Satisfying Interaction Constraints
Sort
View
DLOG
2006
15 years 8 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
CORR
2008
Springer
114views Education» more  CORR 2008»
15 years 6 months ago
Temporal Support of Regular Expressions in Sequential Pattern Mining
Classic algorithms for sequential pattern discovery, return all frequent sequences present in a database. Since, in general, only a few ones are interesting from a user's poin...
Leticia I. Gómez, Bart Kuijpers, Alejandro ...
BMCBI
2010
86views more  BMCBI 2010»
15 years 6 months ago
Protein binding hot spots and the residue-residue pairing preference: a water exclusion perspective
Background: A protein binding hot spot is a small cluster of residues tightly packed at the center of the interface between two interacting proteins. Though a hot spot constitutes...
Qian Liu, Jinyan Li
EDOC
2007
IEEE
16 years 1 months ago
Implementing Business Conversations with Consistency Guarantees Using Message-Oriented Middleware
The paper considers distributed applications where interactions between constituent services take place via messages in an asynchronous environment with unpredictable communicatio...
Carlos Molina-Jiménez, Santosh K. Shrivasta...
PEPM
2009
ACM
17 years 6 months ago
Static Consistency Checking for Verilog Wire Interconnects
The Verilog hardware description language has padding semantics that allow designers to write descriptions where wires of different bit widths can be interconnected. However, many ...
Cherif Salama, Gregory Malecha, Walid Taha, Jim Gr...