1423 search results - page 180 / 285 » Interpreting distributed ontologies |
123
Voted
TCS
2008
15 years 3 months ago
2008
Suppose we are given a set W of logical structures, or possible worlds, a set of logical formulas called possible data and a logical formula . We then consider the classification p...
262
click to vote
PADL
2009
Springer
16 years 4 months ago
2009
Springer
Declarative Networking has been recently promoted as a high-level programming paradigm to more conveniently describe and implement systems that run in a distributed fashion over a ...
111
click to vote
IPPS
2008
IEEE
15 years 10 months ago
2008
IEEE
A file data model for algorithmic skeletons is proposed, focusing on transparency and efficiency. Algorithmic skeletons correspond to a high-level programming model that takes a...
111
Voted
HPDC
1999
IEEE
15 years 7 months ago
1999
IEEE
This paper evaluates linear models for predicting the Digital Unix five-second load average from 1 to 30 seconds into the future. A detailed statistical study of a large number of...
128
Voted
PKDD
1999
Springer
15 years 7 months ago
1999
Springer
We describe the problem of mining possibilistic set-valued rules in large relational tables containing categorical attributes taking a finite number of values. An example of such a...