Query length in best-match information retrieval (IR) systems is well known to be positively related to effectiveness in the IR task, when measured in experimental, non-interactiv...
Nicholas J. Belkin, Diane Kelly, G. Kim, Ja-Young ...
Web searchers reformulate their queries, as they adapt to search engine behavior, learn more about a topic, or simply correct typing errors. Automatic query rewriting can help user...
Rosie Jones, Kevin Bartz, Pero Subasic, Benjamin R...
Support vector machines (SVMs) have been widely used in multimedia retrieval to learn a concept in order to find the best matches. In such a SVM active learning environment, the ...
— In this paper, we introduce a search engine, Dgoogle, designed for large scale P2P systems. Dgoogle is purely text-based, does not organize documents based on pre-defined keyw...
In this paper, we present SURCH, a novel decentralized algorithm for efficient processing of queries generated in sensor networks. Unlike existing techniques, SURCH is fully dist...