824 search results - page 103 / 165 » Constructing Functional Programs for Grammar Analysis Proble... |
159
click to vote
FPCA
1995
15 years 6 months ago
1995
Game semantics is an unusual denotational semantics in that it captures the intensional (or algorithmic) and dynamical aspects of the computation. This makes it an ideal semantica...
117
click to vote
JC
2006
15 years 3 months ago
2006
We study the problem of multivariate integration on the unit cube for unbounded integrands. Our study is motivated by problems in statistics and mathematical finance, where unboun...
219
click to vote
TOPLAS
2008
15 years 2 months ago
2008
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
119
click to vote
STOC
2005
ACM
16 years 3 months ago
2005
ACM
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...
158
click to vote
SMI
2006
IEEE
15 years 9 months ago
2006
IEEE
One of the challenges in geometry processing is to automatically reconstruct a higher-level representation from raw geometric data. For instance, computing a parameterization of a...