993 search results - page 41 / 199 » The Complexity of Probabilistic EL |
ATAL
2009
Springer
14 years 2 months ago
2009
Springer
Knockout tournaments constitute a common format of sporting events, and also model a specific type of election scheme (namely, sequential pairwise elimination election). In such ...
CVIU
2004
13 years 7 months ago
2004
We present an approach for detecting and describing complex buildings with flat or complex rooftops by using multiple, overlapping images of the scene. We find 3-D rooftop boundar...
ECAI
2006
Springer
13 years 11 months ago
2006
Springer
We present an approach to building libraries of tasks in complex action languages such as Golog, for query answering. Our formalization is based on a situation calculus framework t...
STACS
2010
Springer
14 years 2 months ago
2010
Springer
We call a CNF formula linear if any two clauses have at most one variable in common. We show that there exist unsatisfiable linear k-CNF formulas with at most 4k2 4k clauses, and ...
IEEEICCI
2003
IEEE
14 years 1 months ago
2003
IEEE
This paper describes a system capable of classifying stochastic, self-affine, nonstationary signals produced by nonlinear systems. The classification and analysis of these signals...