@conference {15302,
	title = {Ranking under temporal constraints},
	booktitle = {Proceedings of the 19th ACM international conference on Information and knowledge management},
	series = {CIKM {\textquoteright}10},
	year = {2010},
	month = {2010///},
	pages = {79 - 88},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {This paper introduces the notion of temporally constrained ranked retrieval, which, given a query and a time constraint, produces the best possible ranked list within the specified time limit. Naturally, more time should translate into better results, but the ranking algorithm should always produce some results. This property is desirable from a number of perspectives: to cope with diverse users and information needs, as well as to better manage system load and variance in query execution times. We propose two temporally constrained ranking algorithms based on a class of probabilistic prediction models that can naturally incorporate efficiency constraints: one that makes independent feature selection decisions, and the other that makes joint feature selection decisions. Experiments on three different test collections show that both ranking algorithms are able to satisfy imposed time constraints, although the joint model outperforms the independent model in being able to deliver more effective results, especially under tight time constraints, due to its ability to capture feature dependencies.},
	keywords = {efficiency, Learning to rank, Linear Models},
	isbn = {978-1-4503-0099-5},
	doi = {10.1145/1871437.1871452},
	url = {http://doi.acm.org/10.1145/1871437.1871452},
	author = {Wang,Lidan and Metzler,Donald and Jimmy Lin}
}
