Given a set of keywords, we find a maximum Web query (containing the most keywords possible) that respects userdefined bounds on the number of returned hits. We assume a real-world...
Existing search engines contain the picture of the Web from the past and their ranking algorithms are based on data crawled some time ago. However, a user requires not only relevan...
Generic web search is designed to serve all users, independent of the individual needs and without any adaptation to personal requirements. We propose a novel technique1 that perf...
John D. Garofalakis, Theofanis Matsoukas, Yannis P...
Algorithms for clustering web search results have to be efficient and robust. Furthermore they must be able to cluster a dataset without using any kind of a priori information, s...
Steven Schockaert, Martine De Cock, Chris Cornelis...
Searching for a person name in a Web Search Engine usually leads to a number of web pages that refer to several people sharing the same name. In this paper we study whether it is ...
Javier Artiles, Julio Gonzalo, Enrique Amigó...