1266 search results - page 76 / 254 » AS Relationships: Inference and Validation |
CADE
2001
Springer
15 years 10 months ago
2001
Springer
A boolean formula in conjunctive normal form (CNF) F is refuted by literal?once resolution if the empty clause is inferred from F by resolving on each literal of F at most once. Li...
GRC
2005
IEEE
15 years 3 months ago
2005
IEEE
— In this article, a formalism for a specific temporal data mining task (the discovery of rules, inferred from databases of events having a temporal dimension), is defined. The...
MSR
2009
ACM
15 years 2 months ago
2009
ACM
In this paper, we describe a case study at Philips Healthcare MRI focusing on evolutionary couplings, i.e., a technique to infer relationships among modules by analyzing their his...
ISIPTA
1999
IEEE
15 years 2 months ago
1999
IEEE
This paper reviews algorithms for local computation with imprecise probabilities. These algorithms try to solve problems of inference calculation of conditional or unconditional p...
ESOP
1992
Springer
15 years 1 months ago
1992
Springer
Dynamic typing is a program analysis targeted at removing runtime tagging and untagging operations from programs written in dynamically typed languages. This paper compares dynami...