This paper continues our earlier work on (non)adaptive attribute-efficient learning. We consider exact learning of Boolean functions of n variables by membership queries, assuming that at most r variables are relevant. The learner works in consecutive rounds, such that the set of simultaneous querie
โฆ LIBER โฆ
On Learning Multiple Concepts in Parallel
โ Scribed by E. Kinber; C.H. Smith; M. Velauthapillai; R. Wiehagen
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 971 KB
- Volume
- 50
- Category
- Article
- ISSN
- 0022-0000
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
On parallel attribute-efficient learning
โ
Peter Damaschke
๐
Article
๐
2003
๐
Elsevier Science
๐
English
โ 209 KB
Parallel concepts in graph theory
โ
F. Harary
๐
Article
๐
1993
๐
Elsevier Science
๐
English
โ 376 KB
edge of a graph G is taken as a basic unit, regarded as the set of its two nodes. Two edges are called parallel (or independent) if they are disjoint. Then a l-factor (or perfect matching) of G is a spanning set of parallel edges. A l-factorization of G is a partition of its edge set E(G) into l-fac
Parallel concepts in graph theory
๐
Article
๐
1993
๐
Elsevier Science
๐
English
โ 48 KB
Hypothesis memory in concept learning
โ
James Chumbley
๐
Article
๐
1969
๐
Elsevier Science
๐
English
โ 770 KB
Exploiting generalized discriminative mu
โ
Sheng Gao; Qibin Sun
๐
Article
๐
2008
๐
Elsevier Science
๐
English
โ 995 KB
Image and concept in learning mathematic
โ
E. Fischbein
๐
Article
๐
1977
๐
Springer
๐
English
โ 646 KB