Sciweavers

2178 search results - page 180 / 436
» Inferring complex plans
Sort
View
AIPS
2009
15 years 5 months ago
Extended Goals for Composing Services
The ability to automatically compose Web Services is critical for realising more complex functionalities. Several proposals to use automated planning to deal with the problem of s...
Eirini Kaldeli, Alexander Lazovik, Marco Aiello
COMPGEOM
1995
ACM
15 years 7 months ago
A New Technique for Analyzing Substructures in Arrangements
We present a simple but powerful new probabilistic technique for analyzing the combinatorial complexity of various substructures in arrangements of piecewise-linear surfaces in hig...
Boaz Tagansky
IPMI
2007
Springer
15 years 10 months ago
Spine Detection and Labeling Using a Parts-Based Graphical Model
Abstract. The detection and extraction of complex anatomical structures usually involves a trade-off between the complexity of local feature extraction and classification, and th...
Stefan Schmidt, Jörg H. Kappes, Martin Bergth...
TIT
1998
123views more  TIT 1998»
15 years 3 months ago
The Minimum Description Length Principle in Coding and Modeling
—We review the principles of Minimum Description Length and Stochastic Complexity as used in data compression and statistical modeling. Stochastic complexity is formulated as the...
Andrew R. Barron, Jorma Rissanen, Bin Yu
RR
2010
Springer
15 years 2 months ago
Redundancy Elimination on RDF Graphs in the Presence of Rules, Constraints, and Queries
Based on practical observations on rule-based inference on RDF data, we study the problem of redundancy elimination on RDF graphs in the presence of rules (in the form of Datalog r...
Reinhard Pichler, Axel Polleres, Sebastian Skritek...