3047 search results - page 364 / 610 » On the Meaning of Logical Completeness |
HASKELL
2008
ACM
15 years 22 hour ago
2008
ACM
Monads as an organizing principle for programming and semantics are notoriously difficult to grasp, yet they are a central and powerraction in Haskell. This paper introduces a do...
CORR
2007
Springer
14 years 11 months ago
2007
Springer
Abstract. In earlier work, the Abstract State Machine Thesis — that arbitrary algore behaviorally equivalent to abstract state machines — was established for several classes of...
JMIV
2008
14 years 11 months ago
2008
Abstract Shape elongation is one of the basic shape descriptors that has a very clear intuitive meaning. That is the reason for its applicability in many shape classification tasks...
PR
2006
14 years 11 months ago
2006
In this paper, we present counterarguments against the direct LDA algorithm (D-LDA), which was previously claimed to be equivalent to Linear Discriminant Analysis (LDA). We show f...
RE
2006
Springer
14 years 11 months ago
2006
Springer
Domain knowledge is one of crucial factors to get a great success in requirements elicitation of high quality, and only domain experts, not requirements analysts, have it. We prop...