1578 search results - page 94 / 316 » Induction of Stable Models |
114
Voted
CLEF
2009
Springer
15 years 3 months ago
2009
Springer
In biological sequence processing, Multiple Sequence Alignment (MSA) techniques capture information about long-distance dependencies and the three-dimensional structure of protein ...
142
Voted
IEICET
2007
15 years 2 months ago
2007
The completeness (i.e. confluent and terminating) property is an important concept when using a term rewriting system (TRS) as a computational model of functional programming lang...
135
Voted
TCS
2008
15 years 2 months ago
2008
This article presents formalized intuitionistic proofs for the polyhedra genus theorem, the Euler formula and a sufficient condition of planarity. They are based on a hypermap mod...
145
Voted
EMNLP
2011
14 years 2 months ago
2011
We show that categories induced by unsupervised word clustering can surpass the performance of gold part-of-speech tags in dependency grammar induction. Unlike classic clustering ...
102
click to vote
CADE
2008
Springer
16 years 3 months ago
2008
Springer
Rely-guarantee (RG) reasoning is useful for modular Hoare-style proofs of concurrent programs. However, RG requires that assertions be proved stable under the actions of the enviro...