88 search results - page 4 / 18 » Resource Bounded Measure and Learnability |
APLAS
2010
ACM
13 years 7 months ago
2010
ACM
This paper studies the problem of statically determining upper bounds on the resource consumption of first-order functional programs. A previous work approached the problem with an...
IANDC
2006
13 years 7 months ago
2006
This paper studies the complexity of learning classes of expressions in propositional logic from equivalence queries and membership queries. In particular, we focus on bounding th...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
We study the learnability of sets in Rn under the Gaussian distribution, taking Gaussian surface area as the “complexity measure” of the sets being learned. Let CS denote the ...
IPL
2008
13 years 7 months ago
2008
We extend Lutz's resource-bounded measure to probabilistic classes, and obtain notions of resource-bounded measure on probabilistic complexity classes such as BPE and BPEXP. ...
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...