Given a large volume of Web documents, we consider problem of finding the shortest keyword sequences for each of the documents such that a keyword sequence can be rendered to a g...
Search and recommendation systems must include contextual information to effectively model users’ interests. In this paper, we present a systematic study of the effectiveness of...
This paper shows that the performance of peer-to-peer resource discovery algorithms is upper bounded by a k-Steiner minimum tree and proposes an algorithm locating near-optimal qu...
Mikko Vapa, Annemari Auvinen, Yevgeniy Ivanchenko,...
In this paper we report on a study in which genetic algorithms are applied to the analysis of noisy time-series signals, which is related to the problem of analyzing the motion ch...
We describe a method for predicting query difficulty in a precision-oriented web search task. Our approach uses visual features from retrieved surrogate document representations (...
Eric C. Jensen, Steven M. Beitzel, David A. Grossm...