98 search results - page 17 / 20 » Conditional Independence Relations in Possibility Theory |
129
Voted
ICTAI
2009
IEEE
14 years 9 months ago
2009
IEEE
We propose a new method for solving structured CSPs which generalizes and improves the Cyclic-Clustering approach [4]. First, the cutset and the tree-decomposition of the constrai...
110
Voted
ICALP
2007
Springer
15 years 5 months ago
2007
Springer
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
RTA
2005
Springer
15 years 5 months ago
2005
Springer
Proofs of equalities may be built from assumptions using proof rules for reflexivity, symmetry, and transitivity. Reflexivity is an axiom proving x=x for any x; symmetry is a 1-p...
109
click to vote
BTW
2009
Springer
15 years 4 months ago
2009
Springer
: Cost-based optimizers in relational databases make use of data statistics to estimate intermediate result cardinalities. Those cardinalities are needed to estimate access plan co...
98
Voted
ADC
2009
Springer
15 years 6 months ago
2009
Springer
Access control has been studied for sometime, and there are a number of theories and techniques for handling access control for single or centralised systems; however, unique and ...