Statistical models of word-sense disambiguation are often based on a small number of contextual features or on a model that is assumed to characterize the interactions among a set...
A solution to a problem of Erdos, Rubin and Taylor is obtained by showing that if a graph G is (a : b)-choosable, and c/d > a/b, then G is not necessarily (c : d)-choosable. Th...
Defeasible logic is a system of reasoning in which rules have exceptions, and when rules conflict, the one that applies most specifically to the situation wins out. This paper repo...
— In this work, a probabilistic model is established for recurrent networks. The EM (expectation-maximization) algorithm is then applied to derive a new fast training algorithm f...
The search algorithm presented allows the CDF of a dependent variable to be bounded with 100%confidence,andallowsforaguaranteedevaluationof theerror involved.Thesereliabilitybound...