Sciweavers

57 search results - page 9 / 12
» Answering Complex Questions Using Query-Focused Summarizatio...
Sort
View
FROCOS
2007
Springer
13 years 10 months ago
Certification of Automated Termination Proofs
Abstract. Nowadays, formal methods rely on tools of different kinds: proof assistants with which the user interacts to discover a proof step by step; and fully automated tools whic...
Evelyne Contejean, Pierre Courtieu, Julien Forest,...
AIME
2007
Springer
14 years 12 days ago
Hierarchical Latent Class Models and Statistical Foundation for Traditional Chinese Medicine
Traditional Chinese medicine (TCM) is an important avenue for disease prevention and treatment for the Chinese people and is gaining popularity among others. However, many remain s...
Nevin Lianwen Zhang, Shihong Yuan, Tao Chen, Yi Wa...
ICLP
2007
Springer
14 years 10 days ago
Declarative Diagnosis of Temporal Concurrent Constraint Programs
Abstract. We present a framework for the declarative diagnosis of nondeterministic timed concurrent constraint programs. We present a denotational semantics based on a (continuous)...
Moreno Falaschi, Carlos Olarte, Catuscia Palamides...
TSE
2002
157views more  TSE 2002»
13 years 5 months ago
Assessing the Applicability of Fault-Proneness Models Across Object-Oriented Software Projects
A number of papers have investigated the relationships between design metrics and the detection of faults in object-oriented software. Several of these studies have shown that suc...
Lionel C. Briand, Walcélio L. Melo, Jü...
LCC
1994
248views Algorithms» more  LCC 1994»
13 years 10 months ago
Comparing the Power of Monadic NP Games
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...
Ronald Fagin