Sciweavers

993 search results - page 16 / 199
» The Complexity of Probabilistic EL
Sort
View
FOCM
2008
76views more  FOCM 2008»
13 years 7 months ago
On Smale's 17th Problem: A Probabilistic Positive Solution
Smale's 17th Problem asks "Can a zero of n complex polynomial equations in n unknowns be found approximately, on the average [for a suitable probability measure on the s...
Carlos Beltrán, Luis Miguel Pardo
HPCC
2007
Springer
14 years 1 months ago
Towards a Complexity Model for Design and Analysis of PGAS-Based Algorithms
Many new Partitioned Global Address Space (PGAS) programming languages have recently emerged and are becoming ubiquitously available on nearly all modern parallel architectures. PG...
Mohamed Bakhouya, Jaafar Gaber, Tarek A. El-Ghazaw...
AAAI
2012
11 years 10 months ago
A Tractable First-Order Probabilistic Logic
Tractable subsets of first-order logic are a central topic in AI research. Several of these formalisms have been used as the basis for first-order probabilistic languages. Howev...
Pedro Domingos, William Austin Webb
ECAI
1998
Springer
13 years 11 months ago
Probabilistic Logic Programming
We present probabilistic logic programming under inheritance with overriding. This approach is based on new notions of entailment for reasoning with conditional constraints, which...
Thomas Lukasiewicz
MLG
2007
Springer
14 years 1 months ago
Transductive Rademacher Complexities for Learning Over a Graph
Recent investigations [12, 2, 8, 5, 6] and [11, 9] indicate the use of a probabilistic (’learning’) perspective of tasks defined on a single graph, as opposed to the traditio...
Kristiaan Pelckmans, Johan A. K. Suykens