Sciweavers

7106 search results - page 224 / 1422
» Restricted Complexity, General Complexity
Sort
View
CAD
1999
Springer
15 years 3 months ago
Multiple sweeping using the Denavit-Hartenberg representation method
The method of consecutive revolving or extrusion of a geometric entity in a CAD system is typically used by a designer to represent complex solids. While it is evident that consec...
Karim Abdel-Malek, Saeb Othman
DLOG
2008
15 years 6 months ago
SRIQ and SROIQ are Harder than SHOIQ
We identify the complexity of (finite model) reasoning in the DL SROIQ to be N2ExpTime-complete. We also prove that (finite model) reasoning in the DL SR--a fragment of SROIQ witho...
Yevgeny Kazakov
ACSC
2009
IEEE
15 years 11 months ago
Privacy-aware Access Control with Generalization Boundaries
Privacy is today an important concern for both data providers and data users. Data generalization can provide significant protection of an individual’s privacy, which means the...
Min Li, Hua Wang, Ashley W. Plank
ICDM
2008
IEEE
136views Data Mining» more  ICDM 2008»
15 years 10 months ago
Generalized Framework for Syntax-Based Relation Mining
Supervised approaches to Data Mining are particularly appealing as they allow for the extraction of complex relations from data objects. In order to facilitate their application i...
Bonaventura Coppola, Alessandro Moschitti, Daniele...
133
Voted
IJAR
2010
75views more  IJAR 2010»
15 years 2 months ago
Generalized loopy 2U: A new algorithm for approximate inference in credal networks
Credal nets generalize Bayesian nets by relaxing the requirement of precision of probabilities. Credal nets are considerably more expressive than Bayesian nets, but this makes bel...
Alessandro Antonucci, Yi Sun, Cassio P. de Campos,...