Sciweavers

5726 search results - page 230 / 1146
» Supporting annotations on relations
Sort
View
130
Voted
SCW
2006
IEEE
15 years 7 months ago
Discovering Semantic Web Services with and without a Common Ontology Commitment
This paper presents an algorithm to match a semantic Web service request against semantic Web service advertisements. The algorithm is to be used by systems to discover semantic W...
Jorge Cardoso
119
Voted
SAS
2001
Springer
116views Formal Methods» more  SAS 2001»
15 years 5 months ago
Applying Static Analysis Techniques for Inferring Termination Conditions of Logic Programs
We present the implementation of cTI, a system for universal left-termination inference of logic programs, which heavily relies on static analysis techniques. Termination inference...
Frédéric Mesnard, Ulrich Neumerkel
103
Voted
CONCUR
2000
Springer
15 years 5 months ago
An Implicitly-Typed Deadlock-Free Process Calculus
Abstract. We extend Kobayashi and Sumii’s type system for the deadlock-free π-calculus and develop a type reconstruction algorithm. Kobayashi and Sumii’s type system helps hig...
Naoki Kobayashi, Shin Saito, Eijiro Sumii
108
Voted
CORIA
2008
15 years 2 months ago
KWSim: Concepts Similarity Measure
The comparison of manually annotated medical images can be done using the comparison of keywords in a lexical way or using the existing medical thesauri to calculate semantic simil...
Youssef Matar, Elöd Egyed-Zsigmond, Sonia Laj...
103
Voted
SDM
2008
SIAM
112views Data Mining» more  SDM 2008»
15 years 2 months ago
A pattern mining approach toward discovering generalized sequence signatures
Typically, sequence signatures, such as motifs and domains, are assumed to be localized in one region of a sequence or are derived as combinations of the former. We generalize the...
Dietmar H. Dorr, Anne Denton