1379 search results - page 80 / 276 » The Complexity of the Annihilating Polynomial |
167
click to vote
ECSQARU
2009
Springer
16 years 25 days ago
2009
Springer
Partially preordered belief bases are very convenient for an efficient representation of incomplete knowledge. They offer flexibility and avoid to compare unrelated pieces of inf...
186
click to vote
TARK
2009
Springer
16 years 24 days ago
2009
Springer
The logical omniscience feature assumes that an epistemic agent knows all logical consequences of her assumptions. This paper offers a general theoretical framework that views log...
148
click to vote
COCOON
2005
Springer
15 years 11 months ago
2005
Springer
The Satisfactory Partition problem consists of deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neighb...
141
click to vote
ILP
2003
Springer
15 years 11 months ago
2003
Springer
We study several complexity parameters for first order formulas and their suitability for first order learning models. We show that the standard notion of size is not captured by...
163
click to vote
EMNLP
2008
15 years 7 months ago
2008
Confusion networks are a simple representation of multiple speech recognition or translation hypotheses in a machine translation system. A typical operation on a confusion network...