Sciweavers

1545 search results - page 291 / 309
» Defeasible Description Logics
Sort
View
KES
2008
Springer
13 years 7 months ago
Classification and Retrieval through Semantic Kernels
Abstract. This work proposes a family of language-independent semantic kernel functions defined for individuals in an ontology. This allows exploiting wellfounded kernel methods fo...
Claudia d'Amato, Nicola Fanizzi, Floriana Esposito
SIAMCOMP
2008
72views more  SIAMCOMP 2008»
13 years 7 months ago
Plottable Real Number Functions and the Computable Graph Theorem
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...
Vasco Brattka
INTERNET
2002
175views more  INTERNET 2002»
13 years 7 months ago
Web Services Interaction Models, Part 1: Current Practice
of abstractions a middleware system makes available to applications, they figure prominently in determining the breadth and variety of application integration that the middleware s...
Steve Vinoski
ICALP
2009
Springer
14 years 8 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner
ACSAC
2009
IEEE
14 years 2 months ago
An Empirical Approach to Modeling Uncertainty in Intrusion Analysis
: © An Empirical Approach to Modeling Uncertainty in Intrusion Analysis Xinming Ou, Siva Raj Rajagopalan, Sakthiyuvaraja Sakthivelmurugan HP Laboratories HPL-2009-334 intrusion de...
Xinming Ou, Siva Raj Rajagopalan, Sakthiyuvaraja S...