Suppose we have n algorithms, quantum or classical, each computing some bit-value with bounded error probability. We describe a quantum algorithm that uses O( √ n) repetitions of...
— Often document dissemination is limited to a “need to know” basis so as to better maintain organizational trade secrets. Retrieving documents that are off-topic to a user...
Throughout many of the different types of Web searches people perform, the primary tasks are to first craft a query that effectively captures their information needs, and then eva...
How does a search engine company decide what ads to display with each query so as to maximize its revenue? This turns out to be a generalization of the online bipartite matching p...
Aranyak Mehta, Amin Saberi, Umesh V. Vazirani, Vij...
: User interfaces to WWW search engines typically present results as ranked lists of documents. Such lists give users little help in understanding document variation: we propose a ...
Ivan Bretan, Johan Dewe, Anders Hallberg, Niklas W...