740 search results - page 60 / 148 » Lower bounds for Buchsbaum* complexes |
157
click to vote
EOR
2007
15 years 6 months ago
2007
Performance evaluation of complex systems is a critical issue and bounds computation provides confidence about service quality, reliability, etc. of such systems. The stochastic ...
178
click to vote
SOFSEM
2005
Springer
16 years 5 days ago
2005
Springer
Abstract. Treewidth is a graph parameter with several interesting theoretical and practical applications. This survey reviews algorithmic results on determining the treewidth of a ...
159
click to vote
DLOG
2007
15 years 9 months ago
2007
Abstract. Conjunctive query answering is an important DL reasoning task. Although this task is by now quite well-understood, tight complexity bounds for conjunctive query answering...
181
click to vote
JAIR
2002
15 years 6 months ago
2002
We develop, analyze, and evaluate a novel, supervised, specific-to-general learner for a simple temporal logic and use the resulting algorithm to learn visual event definitions fr...
169
click to vote
LOGCOM
2002
15 years 6 months ago
2002
This paper defines and examines model checking games for the branching time temporal logic CTL . The games employ a technique called focus which enriches sets by picking out one d...