256 search results - page 6 / 52 » Separation of NP-Completeness Notions |
UAI
1990
13 years 8 months ago
1990
We examine the notion of "unrelatedness" in a probabilistic framework. Three formulations are presented. In the first formulation, two variables a and b are totally inde...
IJEIS
2010
13 years 4 months ago
2010
Abstract. Ontologies are today used to annotate web data with machine processable semantics and for domain modeling. As the use of ontologies increases and the ontologies themselve...
ICA
2007
Springer
14 years 1 months ago
2007
Springer
The discussion in this paper revolves around the notion of separation problems. The latter can be thought of as a unifying concept which includes a variety of important problems in...
ECOOP
2010
Springer
13 years 10 months ago
2010
Springer
Specifications of Object-Oriented programs conventionally employ Boolean expressions of the programming language for assertions. Programming errors can be discovered by checking at...
EUROCRYPT
2007
Springer
14 years 1 months ago
2007
Springer
We study conditional computational entropy: the amount of randomness a distribution appears to have to a computationally bounded observer who is given some correlated information....