Sciweavers

2742 search results - page 18 / 549
» Deriving Category Theory from Type Theory
Sort
View
FOCS
1998
IEEE
14 years 29 days ago
A Linguistic Characterization of Bounded Oracle Computation and Probabilistic Polynomial Time
We present a higher-order functional notation for polynomial-time computation with arbitrary 0; 1-valued oracle. This provides a linguistic characterization for classes such as np...
John C. Mitchell, Mark Mitchell, Andre Scedrov
FLAIRS
2000
13 years 10 months ago
Reasoning from Data Rather than Theory
Thecurrent frameworkfor constructing intelligent tutoring systems(ITS) is to use psychological/pedagogical theories of learning, and encode this knowledgeinto the tutor. However,t...
Joseph E. Beck, Beverly Park Woolf
SYNASC
2006
IEEE
86views Algorithms» more  SYNASC 2006»
14 years 2 months ago
Implementing Parameterized Type Algorithm Definitions in Mathematica
The paper focuses on means of defining parameterized type categories and algorithms built on such types in Mathematica. Symbolic algorithms based on category theory have the advan...
Alina Andreica
LICS
2000
IEEE
14 years 1 months ago
Complete Axioms for Categorical Fixed-Point Operators
We give an axiomatic treatment of fixed-point operators in categories. A notion of iteration operator is defined, embodying the equational properties of iteration theories. We p...
Alex K. Simpson, Gordon D. Plotkin
NIPS
2004
13 years 10 months ago
Class-size Independent Generalization Analsysis of Some Discriminative Multi-Category Classification
We consider the problem of deriving class-size independent generalization bounds for some regularized discriminative multi-category classification methods. In particular, we obtai...
Tong Zhang