1730 search results - page 170 / 346 » Algebra and Computation |
185
Voted
CALCO
2011
Springer
14 years 3 months ago
2011
Springer
Abstract. We investigate the phenomenon that every monad is a linear state monad. We do this by studying a fully-complete state-passing translation from an impure call-by-value lan...
131
click to vote
MKM
2004
Springer
15 years 9 months ago
2004
Springer
This paper reports on refinements and extensions to the MathLang framework that add substantial support for natural language text. We show how the extended framework supports mult...
113
Voted
AMC
2005
15 years 3 months ago
2005
In this paper, by using the theories and methods of mathematical analysis and computer algebra, a reliable algorithm of reduction of order approximation method for solving singula...
120
Voted
CIE
2005
Springer
15 years 9 months ago
2005
Springer
1 and 2, and in the last Section 4 of this abstract I will outline very briefly some conclusions about recursion and complexity which I believe that they support. 1 Partial Algebr...
224
Voted
SIGMOD
2007
ACM
16 years 4 months ago
2007
ACM
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be i...