Pages that link to "Item:Q1342733"
From MaRDI portal
The following pages link to On-line learning of rectangles and unions of rectangles (Q1342733):
Displaying 16 items.
- Learning unions of high-dimensional boxes over the reals (Q294744) (← links)
- Classic learning (Q676240) (← links)
- Learning unions of \(\omega(1)\)-dimensional rectangles (Q950197) (← links)
- Learning boxes in high dimension (Q1271193) (← links)
- Algorithms and lower bounds for on-line learning of geometrical concepts (Q1329679) (← links)
- PAC learning axis-aligned rectangles with respect to product distributions from multiple-instance examples (Q1383190) (← links)
- Efficient learning with virtual threshold gates (Q1383714) (← links)
- Direct and indirect algorithms for on-line learning of disjunctions (Q1603594) (← links)
- The learnability of unions of two rectangles in the two-dimensional discretized space (Q1807675) (← links)
- Online learning of binary and \(n\)-ary relations over clustered domains. (Q1872704) (← links)
- Intrinsic complexity of learning geometrical concepts from positive data (Q1877693) (← links)
- The bounded injury priority method and the learnability of unions of rectangles (Q1919530) (← links)
- A good sampling method for guessing rectangles in \([0,1]^2\) (Q2725824) (← links)
- Behavioral shaping for geometric concepts (Q3174143) (← links)
- Learning Integer Lattices (Q3990652) (← links)
- An optimal algorithm for proper learning of unions of two rectangles with queries (Q6085720) (← links)
