149 search results - page 15 / 30 » A realizability interpretation for classical analysis |
WSC
2007
13 years 10 months ago
2007
Models of real world systems are being increasingly generated from data that describes the behaviour of systems. Data mining techniques, such as Artificial Neural Networks (ANN),...
IWRIDL
2006
ACM
14 years 1 months ago
2006
ACM
We present the state of the art of a computational platform for the analysis of classical Sanskrit. The platform comprises modules for phonology, morphology, segmentation and shal...
GPCE
2008
Springer
13 years 8 months ago
2008
Springer
The influential pure embedding methodology of embedding domainspecific languages (DSLs) as libraries into a general-purpose host language forces the DSL designer to commit to a ...
LICS
2003
IEEE
14 years 27 days ago
2003
IEEE
We present a constructive procedure for extracting polynomial-time realizers from ineffective proofs of Π0 2theorems in feasible analysis. By ineffective proof we mean a proof wh...
BMCBI
2007
13 years 7 months ago
2007
Background: Most existing algorithms for the inference of the structure of gene regulatory networks from gene expression data assume that the activity levels of transcription fact...