845 search results - page 13 / 169 » Complexity Dimensions and Learnability |
NIPS
2001
13 years 8 months ago
2001
We give results about the learnability and required complexity of logical formulae to solve classification problems. These results are obtained by linking propositional logic with...
ORDER
2010
13 years 5 months ago
2010
Embedding a partially ordered set into a product of chains is a classical way to encode it. Such encodings have been used in various fields such as object oriented programming or ...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
— In contrast to the prevalent assumption of rich multipath in information theoretic analysis of wireless channels, physical channels exhibit sparse multipath, especially at larg...
EUROCOLT
1997
Springer
13 years 11 months ago
1997
Springer
The approach of ordinal mind change complexity, introduced by Freivalds and Smith, uses (notations for) constructive ordinals to bound the number of mind changes made by a learnin...
EUROCOLT
1995
Springer
13 years 11 months ago
1995
Springer
Limiting identification of r.e. indexes for r.e. languages (from a presentation of elements of the language) and limiting identification of programs for computable functions (fr...