Sciweavers

2623 search results - page 170 / 525
» Universal Learning Theory
Sort
View
ENTCS
2006
153views more  ENTCS 2006»
15 years 4 months ago
Parametric Domain-theoretic Models of Polymorphic Intuitionistic / Linear Lambda Calculus
We present a formalization of a version of Abadi and Plotkin's logic for parametricity for a polymorphic dual intuitionistic / linear type theory with fixed points, and show,...
Lars Birkedal, Rasmus Ejlers Møgelberg, Ras...
JACM
2002
122views more  JACM 2002»
15 years 4 months ago
Cosmological lower bound on the circuit complexity of a small problem in logic
An exponential lower bound on the circuit complexity of deciding the weak monadic second-order theory of one successor (WS1S) is proved. Circuits are built from binary operations, ...
Larry J. Stockmeyer, Albert R. Meyer
130
Voted
LOGCOM
2010
82views more  LOGCOM 2010»
15 years 3 months ago
Deduction Systems for Coalgebras Over Measurable Spaces
A theory of infinitary deduction systems is developed for the modal logic of coalgebras for measurable polynomial functors on the category of measurable spaces. These functors ha...
Robert Goldblatt
132
Voted
CORR
2002
Springer
95views Education» more  CORR 2002»
15 years 4 months ago
Unsupervised Learning of Morphology without Morphemes
The first morphological learner based upon the theory of Whole Word Morphology (Ford et al., 1997) is outlined, and preliminary evaluation results are presented. The program, Whol...
Sylvain Neuvel, Sean A. Fulop
MCS
2005
Springer
15 years 10 months ago
Ensembles of Classifiers from Spatially Disjoint Data
We describe an ensemble learning approach that accurately learns from data that has been partitioned according to the arbitrary spatial requirements of a large-scale simulation whe...
Robert E. Banfield, Lawrence O. Hall, Kevin W. Bow...