13603 search results - page 75 / 2721 » On the Computational Complexity of Cut-Reduction |
145
click to vote
COMCOM
2004
15 years 5 months ago
2004
The Private Network-to-Network Interface (PNNI) is a scalable hierarchical protocol that allows ATM switches to be aggregated into clusters called peer groups. To provide good acc...
153
click to vote
DLOG
2003
15 years 7 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...
143
click to vote
CG
2004
Springer
15 years 5 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 ...
152
click to vote
ATAL
2006
Springer
15 years 9 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...
195
click to vote
SIGGRAPH
1996
ACM
15 years 10 months ago
1996
ACM
We present a new method that utilizes path coherence to accelerate walkthroughs of geometrically complex static scenes. As a preprocessing step, our method constructs a BSP-tree t...