Computing arbitrary functions of encrypted data

C Gentry - Communications of the ACM, 2010 - dl.acm.org
Suppose that you want to delegate the ability to process your data, without giving away
access to it. We show that this separation is possible: we describe a" fully homomorphic" …

A survey on evaluation of summarization methods

L Ermakova, JV Cossu, J Mothe - Information processing & management, 2019 - Elsevier
The increasing volume of textual information on any topic requires its compression to allow
humans to digest it. This implies detecting the most important information and condensing it …

A survey on tree matching and XML retrieval

MA Tahraoui, K Pinel-Sauvagnat, C Laitang… - Computer Science …, 2013 - Elsevier
With the increasing number of available XML documents, numerous approaches for retrieval
have been proposed in the literature. They usually use the tree representation of documents …

Overview of the INEX 2009 entity ranking track

G Demartini, T Iofciu, AP De Vries - … Workshop of the Initiative for the …, 2009 - Springer
In some situations search engine users would prefer to retrieve entities instead of just
documents. Example queries include “Italian Nobel prize winners”,“Formula 1 drivers that …

Ester: efficient search on text, entities, and relations

H Bast, A Chitea, F Suchanek, I Weber - Proceedings of the 30th annual …, 2007 - dl.acm.org
We present ESTER, a modular and highly efficient system for combined full-text and
ontology search. ESTER builds on a query engine that supports two basic operations: prefix …

[PDF][PDF] Building linguistic corpora from Wikipedia articles and discussions

E Margaretha, H Lüngen - Journal for Language Technology and …, 2014 - jlcl.org
Wikipedia is a valuable resource, useful as a lingustic corpus or a dataset for many kinds of
research. We built corpora from Wikipedia articles and talk pages in the I5 format, a TEI …

Entity ranking using Wikipedia as a pivot

R Kaptein, P Serdyukov, A De Vries… - Proceedings of the 19th …, 2010 - dl.acm.org
In this paper we investigate the task of Entity Ranking on the Web. Searchers looking for
entities are arguably better served by presenting a ranked list of entities directly, rather than …

[PDF][PDF] Towards an Efficient and Effective Search Engine.

A Trotman, X Jia, M Crane - OSIR@ SIGIR, 2012 - cs.otago.ac.nz
Towards an Efficient and Effective Search Engine. Page 45 Towards an Efficient and Effective
Search Engine Andrew Trotman Department of Computer Science University of Otago Dunedin …

Exploiting the category structure of Wikipedia for entity ranking

R Kaptein, J Kamps - Artificial Intelligence, 2013 - Elsevier
The Web has not only grown in size, but also changed its character, due to collaborative
content creation and an increasing amount of structure. Current Search Engines find Web …