The Learnability of Unions of Two Rectangles in the Two-Dimensional Discretized Space
β Scribed by Zhixiang Chen; Foued Ameur
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 246 KB
- Volume
- 59
- Category
- Article
- ISSN
- 0022-0000
No coin nor oath required. For personal study only.
β¦ Synopsis
We study the problem of properly learning unions of two axis-parallel rectangles over the domain [0, n&1] 2 in the on-line model with equivalence queries. When only O(log n) equivalence queries are allowed, this problem is one of the five interesting open problems proposed by W. Maass and G. Tura n (Mach. Learning 14, 1994, 251 269), regarding learning geometric concepts. In this paper, we design an efficient algorithm that properly learns unions of two rectangles over the domain [0, n&1] 2 using O(log 2 n) equivalence queries.
π SIMILAR VOLUMES
A graph G is perfectly orderable, if it admits an order < on its vertices such that the sequential coloring algorithm delivers an optimum coloring on each induced subgraph (H, <) of (G, <). A graph is a threshold graph, if it contains no P 4 , 2K 2 , and C 4 as induced subgraph. A theorem of ChvΓ‘tal
The dissolution of a disk-like Al 2 Cu particle is considered. A characteristic property is that initially the particle has a nonsmooth boundary. The mathematical model of this dissolution process contains a description of the particle interface, of which the position varies in time. Such a model is
**They say you can never go home. But, you can clean it.** Triana Moore, maintenance bot technician on Station Kelly-Kornienko, prefers life in orbit where the air is purified, the commute is short, and nature doesnβt get all over you. But when a minor infraction gets her sent to remedial training