Title

Author 1

Affiliation

Author 2

Affiliation

Author 3

Affiliation

Abstract – Insert abstract here

Keywords – Insert Keywords here

INTRODUCTION

Text goes here. This demo file is intended to serve as a ``starter file'' for IEEE conference papers

REFERENCES

Burkard , R.E., Dell'Amico M., Martello S. Assignment Problems. 2009. SIAM, Philadelphia (PA.)

Cohn, D. A., Ghahramani, Z., J

Text goes here. This demo file is intended to serve as a ``starter file'' for IEEE conference papers

ordan, M. I. 1996. Active learning with statistical models. Journal of Artificial Intelligence Research, 4, 129–145.

Kaelbling L.P. 1993. Learning in Embedded Systems. MIT Press.

Kazienko P., Adamski M. 2007. AdROSA - Adaptive personalization of web advertising, Information Sciences, Volume 177, Issue 11, Pages 2269-2295

Kuhn, Harold W. 1955. The Hungarian Method for the assignment problem, Naval Research Logistics Quarterly, 2:83–97. Kuhn's original publication.

Limbo’s Mobile Advertising Report US Users, 1st quarter 2009

M. Saar-Tsechansky, F. Provost. 2007. Decision-Centric Active Learning of Binary-Outcome Models, Information systems research, 18(1): 4-22.

Radlinski, F., Broder, A., Ciccolo, P., Gabrilovich, E., Josifovski, V., and Riedel, L. 2008. Optimizing relevance and revenue in ad search: a query substitution approach. In Proceedings of the 31st Annual international ACM SIGIR Conference on Research and Development in information Retrieval (Singapore, Singapore, July 20 - 24, 2008). SIGIR '08. ACM, New York, NY, 403-410.

Rokach L., Naamani L., Shmilovici A. 2008. Pessimistic Cost-sensitive Active Learning of Decision Trees for Profit Maximizing Targeting Campaigns. Data Mining and Knowledge Discovery. Volume 17 (2), pages 283-316.