@conference {17554,
	title = {Approximating hyper-rectangles: learning and pseudo-random sets},
	booktitle = {Proceedings of the twenty-ninth annual ACM symposium on Theory of computing},
	series = {STOC {\textquoteright}97},
	year = {1997},
	month = {1997///},
	pages = {314 - 323},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	keywords = {approximations of distributions, derandomization, explicit constructions, machine learning, multiple-instance learning, PAC learning, pseudorandomness, Ramsey graphs, random graphs, rectangles, sample complexity},
	isbn = {0-89791-888-6},
	doi = {10.1145/258533.258611},
	url = {http://doi.acm.org/10.1145/258533.258611},
	author = {Auer,Peter and Long,Philip M. and Srinivasan, Aravind}
}
