Sciweavers

4218 search results - page 28 / 844
» Complete sets of cooperations
Sort
View
DLOG
2011
12 years 11 months ago
Implementing Completion-Based Inferences for the EL-family
Completion algorithms for subsumption are investigated for many extensions of the description logic EL. While for several of them subsumption is tractable, this is no longer the ca...
Julian Mendez, Andreas Ecke, Anni-Yasmin Turhan
BILDMED
2007
148views Algorithms» more  BILDMED 2007»
13 years 9 months ago
Complete Digital Iconic and Textual Annotation for Mammography
This work aims to propose an interactive method for a iconic and textual annotation of digital mammograms. The suggested annotation tool consists of a semantic network to represent...
Thomas Wittenberg, Matthias Elter, Rüdiger Sc...
LREC
2008
132views Education» more  LREC 2008»
13 years 9 months ago
Complete and Consistent Annotation of WordNet using the Top Concept Ontology
This paper presents the complete and consistent ontological annotation of the nominal part of WordNet. The annotation has been carried out using the semantic features defined in t...
Javier Álvez, Jordi Atserias, Jordi Carrera...
ECAI
2010
Springer
13 years 8 months ago
Sound and Complete Landmarks for And/Or Graphs
Landmarks for a planning problem are subgoals that are necessarily made true at some point in the execution of any plan. Since verifying that a fact is a landmark is PSPACE-complet...
Emil Keyder, Silvia Richter, Malte Helmert
SACMAT
2006
ACM
14 years 1 months ago
Constraint generation for separation of duty
Separation of Duty (SoD) is widely recognized to be a fundamental principle in computer security. A Static SoD (SSoD) policy states that in order to have all permissions necessary...
Hong Chen, Ninghui Li