Sciweavers

1159 search results - page 69 / 232
» Binary Decision Graphs
Sort
View
IJCAI
2001
13 years 11 months ago
Efficient Consequence Finding
We present an extensive experimental study of consequence-finding algorithms based on kernel resolution, using both a trie-based and a novel ZBDD-based implementation, which uses ...
Laurent Simon, Alvaro del Val
ESORICS
2010
Springer
13 years 11 months ago
An Authorization Framework Resilient to Policy Evaluation Failures
Abstract. In distributed computer systems, it is possible that the evaluation of an authorization policy may suffer unexpected failures, perhaps because a sub-policy cannot be eval...
Jason Crampton, Michael Huth
JUCS
2010
143views more  JUCS 2010»
13 years 8 months ago
Design of Arbiters and Allocators Based on Multi-Terminal BDDs
: Assigning one (more) shared resource(s) to several requesters is a function of arbiters (allocators). This class of decision-making modules can be implemented in a number of ways...
Václav Dvorák, Petr Mikusek
CVPR
2011
IEEE
13 years 5 months ago
Mining Discriminative Co-occurrence Patterns for Visual Recognition
The co-occurrence pattern, a combination of binary or local features, is more discriminative than individual features and has shown its advantages in object, scene, and action rec...
Junsong Yuan, Ming Yang, Ying Wu
RSKT
2010
Springer
13 years 8 months ago
Naive Bayesian Rough Sets
A naive Bayesian classifier is a probabilistic classifier based on Bayesian decision theory with naive independence assumptions, which is often used for ranking or constructing a...
Yiyu Yao, Bing Zhou