900 search results - page 124 / 180 » Metric Structures and Probabilistic Computation |
DNA
2005
Springer
14 years 2 months ago
2005
Springer
We introduce a class of generalized DNF formulae called wDNF or weighted disjunctive normal form, and present a molecular algorithm that learns a wDNF formula from training example...
NIPS
2001
13 years 10 months ago
2001
Unsupervised learning algorithms have been derived for several statistical models of English grammar, but their computational complexity makes applying them to large data sets int...
AIPS
1996
13 years 10 months ago
1996
An increasing number of planners can handle uncertainty in the domain or in action outcomes. However, less work has addressed building plans when the planner's world can chan...
IDA
2010
Springer
13 years 7 months ago
2010
Springer
In this paper we introduce three alternative combinatorial formulations of the theory of evidence (ToE), by proving that both plausibility and commonality functions share the stru...
LICS
2010
IEEE
13 years 7 months ago
2010
IEEE
—We provide a syntactic analysis of contextual preorder and equivalence for a polymorphic programming language with effects. Our approach applies uniformly across a range of alge...