Sciweavers

33 search results - page 1 / 7
» Least Common Subsumption as a connective
Sort
View
DLOG
1997
13 years 6 months ago
Least Common Subsumption as a connective
Véronique Ventos, Pierre Brézellec
AICOM
2006
124views more  AICOM 2006»
13 years 4 months ago
A Compact Representation for Least Common Subsumers in the description logic ALE
This paper introduces a compact representation which helps to avoid the exponential blow-up in space of the Least Common Subsumer (lcs) of two ALEconcept descriptions. Based on th...
Chan Le Duc, Nhan Le Thanh, Marie-Christine Rousse...
DLOG
2011
12 years 8 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
PAMI
2012
11 years 7 months ago
A Least-Squares Framework for Component Analysis
— Over the last century, Component Analysis (CA) methods such as Principal Component Analysis (PCA), Linear Discriminant Analysis (LDA), Canonical Correlation Analysis (CCA), Lap...
Fernando De la Torre
ESORICS
2007
Springer
13 years 11 months ago
Maintaining High Performance Communication Under Least Privilege Using Dynamic Perimeter Control
Abstract. From a security standpoint, it is preferable to implement least privilege network security policies in which only the bare minimum of TCP/UDP ports on internal hosts are ...
Paul Z. Kolano