Learning Unions of ω ( 1 )-Dimensional Rectangles

@inproceedings{Atc2006LearningUO,
  title={Learning Unions of ω ( 1 )-Dimensional Rectangles},
  author={Alp Atıcı},
  year={2006}
}
  • Alp Atıcı
  • Published 2006
We consider the problem of learning unions of rectangles over the domain [b]n, in the uniform distribution membership query learning setting, where both b and n are “large”. We obtain poly(n, log b)-time algorithms for the following classes: • poly(n log b)-MAJORITY of O( log(n log b) log log(n log b))-dimensional rectangles. • Union of poly(log(n log b)) O( log (n log b) (log log(n log b) log log log(n log b))2 )-dimensional rectangles. • poly(n log b)-MAJORITY of poly(n log b)-OR of disjoint… CONTINUE READING

From This Paper

Topics from this paper.
4 Citations
20 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 20 references

Remarques sur un résultat non publié de B

  • G. Pisier
  • Maurey, Séminaire d’Analyse Fonctionnelle, 1(12…
  • 1981
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…