921 search results - page 58 / 185 » Expressing Computational Complexity in Constructive Type The... |
BIRTHDAY
1999
Springer
14 years 4 days ago
1999
Springer
We define simple-regular expressions and languages. Simple-regular languages provide a necessary condition for a language to be outfix-free. We design algorithms that compute si...
ICCV
2003
IEEE
14 years 9 months ago
2003
IEEE
In this paper, we present a mathematical theory for Marr's primal sketch. We first conduct a theoretical study of the descriptive Markov random field model and the generative...
CORR
2000
Springer
13 years 7 months ago
2000
Springer
The probability distribution P from which the history of our universe is sampled represents a theory of everything or TOE. We assume P is formally describable. Since most (uncount...
JCC
2002
13 years 7 months ago
2002
: Generalized Born (GB) models provide, for many applications, an accurate and computationally facile estimate of the electrostatic contribution to aqueous solvation. The GB models...
ICFP
2005
ACM
14 years 7 months ago
2005
ACM
We explore partial type-inference for System F based on type-containment. We consider both cases of a purely functional semantics and a call-by-value stateful semantics. To enable...