Sciweavers

4218 search results - page 178 / 844
» Complete sets of cooperations
Sort
View
PODS
2004
ACM
86views Database» more  PODS 2004»
14 years 10 months ago
Frontiers of Tractability for Typechecking Simple XML Transformations
Typechecking consists of statically verifying whether the output of an XML transformation is always conform to an output type for documents satisfying a given input type. We focus...
Wim Martens, Frank Neven
DCC
2005
IEEE
14 years 10 months ago
Support Weight Enumerators and Coset Weight Distributions of Isodual Codes
In this paper various methods for computing the support weight enumerators of binary, linear, even, isodual codes are described. It is shown that there exist relationships between...
Olgica Milenkovic
TABLEAUX
2009
Springer
14 years 5 months ago
Automated Synthesis of Tableau Calculi
This paper presents a method for synthesising sound and complete tableau calculi. Given a specification of the formal semantics of a logic, the method generates a set of tableau i...
Renate A. Schmidt, Dmitry Tishkovsky
CSB
2005
IEEE
223views Bioinformatics» more  CSB 2005»
14 years 4 months ago
Automatic Protein Function Annotation through Candidate Ortholog Clusters from Incomplete Genomes
Annotation of protein function often arises in the context of partially complete genomes but is not adequately addressed. We present an annotation method by extracting ortholog cl...
Akshay Vashist, Casimir A. Kulikowski, Ilya B. Muc...
ICMB
2005
IEEE
118views Business» more  ICMB 2005»
14 years 4 months ago
A Context-Sensitive Service Discovery Protocol for Mobile Computing Environments
Service discovery is important in mobile and pervasive computing environments, where the set of resources available to an entity changes dynamically over time. This paper describe...
Ricky Robinson, Jadwiga Indulska