Document expansion and query expansion aim to add related terms into document and query representations in order to make them more complete. However, most previous studies are lim...
Abstract—This paper introduces and analyzes a new approach to query suggestion. After the user issues a query q0, for every document retrieved in a certain rank range [Θ1, Θ2],...
The paper presents two approaches to interactively refining user search formulations and their evaluation in the new High Accuracy Retrieval from Documents (HARD) track of TREC-12...
—A method for locating mathematical expressions in document images without the use of optical character recognition is presented. An index of document regions is produced from re...
Abstract-- Current twig join algorithms incur high memory costs on queries that involve child-axis nodes. In this paper we provide an analytical explanation for this phenomenon. In...