338 search results - page 41 / 68 » On the Complexity of Termination Inference for Processes |
WSC
2007
14 years 12 months ago
2007
Planning, scheduling and effective management of contingencies are crucial for the successful management of construction projects. In this paper we explore a mathematical represen...
ACL
2006
14 years 11 months ago
2006
There are two decoding algorithms essential to the area of natural language processing. One is the Viterbi algorithm for linear-chain models, such as HMMs or CRFs. The other is th...
100
click to vote
CLA
2004
14 years 11 months ago
2004
Ontology design is a complex and time-consuming process. It is extremely difficult for human experts to discover ontology from given data or texts. This paper presents a semi-autom...
RIAO
2000
14 years 11 months ago
2000
We present a framework to analyze color documents of complex layout. In addition, no assumption is made on the layout. Our framework combines in a content-driven bottom-up approac...
110
click to vote
JOLLI
1998
14 years 9 months ago
1998
When reasoning about complex domains, where information available is usually only partial, nonmonotonic reasoning can be an important tool. One of the formalisms introduced in thi...