Sciweavers

148 search results - page 9 / 30
» Strong and Weak Policy Relations
Sort
View
AE
2005
Springer
14 years 1 months ago
Evolutionary Design of a DDPD Model of Ligation
Ligation is a form of chemical self-assembly that involves dynamic formation of strong covalent bonds in the presence of weak associative forces. We study an extremely simple form ...
Mark A. Bedau, Andrew Buchanan, Gianluca Gazzola, ...
SACMAT
2009
ACM
14 years 2 months ago
Access control policy combining: theory meets practice
Many access control policy languages, e.g., XACML, allow a policy to contain multiple sub-policies, and the result of the policy on a request is determined by combining the result...
Ninghui Li, Qihua Wang, Wahbeh H. Qardaji, Elisa B...
ICPR
2006
IEEE
14 years 8 months ago
Ent-Boost: Boosting Using Entropy Measure for Robust Object Detection
Recently, boosting is used widely in object detection applications because of its impressive performance in both speed and accuracy. However, learning weak classifiers which is on...
Duy-Dinh Le, Shin'ichi Satoh
APAL
2010
125views more  APAL 2010»
13 years 7 months ago
The computable Lipschitz degrees of computably enumerable sets are not dense
The computable Lipschitz reducibility was introduced by Downey, Hirschfeldt and LaForte under the name of strong weak truthtable reducibility [6]. This reducibility measures both t...
Adam R. Day
EOR
2008
99views more  EOR 2008»
13 years 7 months ago
Ordinal regression revisited: Multiple criteria ranking using a set of additive value functions
We present a new method, called UTAGMS , for multiple criteria ranking of alternatives from set A using a set of additive value functions which result from an ordinal regression. ...
Salvatore Greco, Vincent Mousseau, Roman Slowinski