Sciweavers

3047 search results - page 364 / 610
» On the Meaning of Logical Completeness
Sort
View
HASKELL
2008
ACM
15 years 8 months ago
Making monads first-class with template haskell
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...
Pericles S. Kariotis, Adam M. Procter, William L. ...
CORR
2007
Springer
103views Education» more  CORR 2007»
15 years 7 months ago
Interactive Small-Step Algorithms I: Axiomatization
Abstract. In earlier work, the Abstract State Machine Thesis — that arbitrary algore behaviorally equivalent to abstract state machines — was established for several classes of...
Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Ben...
JMIV
2008
94views more  JMIV 2008»
15 years 7 months ago
Measuring Elongation from Shape Boundary
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...
Milos Stojmenovic, Jovisa D. Zunic
PR
2006
65views more  PR 2006»
15 years 7 months ago
Why direct LDA is not equivalent to LDA
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...
Hui Gao, James W. Davis
RE
2006
Springer
15 years 7 months ago
Using Domain Ontology as Domain Knowledge for Requirements Elicitation
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...
Haruhiko Kaiya, Motoshi Saeki