Sciweavers

149 search results - page 30 / 30
» Encoding Planning Problems in Nonmonotonic Logic Programs
Sort
View
FOCS
1998
IEEE
13 years 9 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello
CORR
2004
Springer
120views Education» more  CORR 2004»
13 years 5 months ago
Validating a Web Service Security Abstraction by Typing
Abstraction by Typing Andrew D. Gordon Microsoft Research Riccardo Pucella Cornell University An XML web service is, to a first approximation, an RPC service in which requests and...
Andrew D. Gordon, Riccardo Pucella
IEEEPACT
2005
IEEE
13 years 11 months ago
A Distributed Control Path Architecture for VLIW Processors
VLIW architectures are popular in embedded systems because they offer high-performance processing at low cost and energy. The major problem with traditional VLIW designs is that t...
Hongtao Zhong, Kevin Fan, Scott A. Mahlke, Michael...
BMCBI
2004
229views more  BMCBI 2004»
13 years 5 months ago
Automatic annotation of protein motif function with Gene Ontology terms
Background: Conserved protein sequence motifs are short stretches of amino acid sequence patterns that potentially encode the function of proteins. Several sequence pattern search...
Xinghua Lu, Chengxiang Zhai, Vanathi Gopalakrishna...