306 search results - page 41 / 62 » Underspecified computation of normal forms |
CP
2009
Springer
14 years 8 months ago
2009
Springer
The goal of testing is to distinguish between a number of hypotheses about a systemfor example, dierent diagnoses of faults by applying input patterns and verifying or falsifying t...
TLCA
2005
Springer
14 years 1 months ago
2005
Springer
We use a fully abstract denotational model to show that nested function calls and recursive definitions can be eliminated from SPCF (a typed functional language with simple non-lo...
ISTCS
1997
Springer
13 years 11 months ago
1997
Springer
Kearns introduced the "statistical query" (SQ) model as a general method for producing learning algorithms which are robust against classification noise. We extend this ...
ENTCS
2008
13 years 7 months ago
2008
We describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem of second-order linear logic with restricted rules for exponentials, correct and co...
ICVS
2009
Springer
13 years 5 months ago
2009
Springer
This paper introduces a system that automatically classifies registration problems based on the type of registration required. Rather than rely on a single "best" algorit...