Sciweavers

1423 search results - page 180 / 285
» Interpreting distributed ontologies
Sort
View
TCS
2008
13 years 9 months ago
Absolute versus probabilistic classification in a logical setting
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...
Sanjay Jain, Eric Martin, Frank Stephan
PADL
2009
Springer
14 years 10 months ago
Operational Semantics for Declarative Networking
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 ...
Juan A. Navarro, Andrey Rybalchenko
IPPS
2008
IEEE
14 years 4 months ago
A transparent non-invasive file data model for algorithmic skeletons
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...
Denis Caromel, Mario Leyton
HPDC
1999
IEEE
14 years 1 months ago
An Evaluation of Linear Models for Host Load Prediction
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...
Peter A. Dinda, David R. O'Hallaron
PKDD
1999
Springer
118views Data Mining» more  PKDD 1999»
14 years 1 months ago
Mining Possibilistic Set-Valued Rules by Generating Prime Disjunctions
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...
Alexandr A. Savinov