13603 search results - page 191 / 2721 » On the Complexity of Computing Treelength |
135
click to vote
STACS
2005
Springer
15 years 10 months ago
2005
Springer
Dynamic complexity investigates the required effort to maintain knowledge about a property of a structure under changing operations. This article introduces a refined notion of ...
132
click to vote
DLOG
2003
15 years 5 months ago
2003
We present lower bounds on the computational complexity of satisfiability and subsumption in several description logics. We interpret these lower bounds as coming from different...
118
click to vote
CG
2004
Springer
15 years 4 months ago
2004
Springer
This work presents a stratification approach for modeling two-dimensional cell complexes. It introduces the concept of combinatorial stratification and uses the Handlebody theory ...
113
Voted
ICRA
2009
IEEE
15 years 11 months ago
2009
IEEE
— This paper addresses two key limitations of the unscented Kalman filter (UKF) when applied to the simultaneous localization and mapping (SLAM) problem: the cubic, in the numbe...
136
click to vote
ATAL
2006
Springer
15 years 8 months ago
2006
Springer
There is a recent trend of extending epistemic logic (EL) with dynamic operators that allow to express the evolution of knowledge and induced by knowledge-changing actions. The mo...