We present a single-database private information retrieval (PIR) scheme with communication complexity O(k+d), where k ≥ log n is a security parameter that depends on the database...
Individuals often use search engines to return to web pages they have previously visited. This behaviour, called refinding, accounts for about 38% of all queries. While researcher...
We propose an original automatic alignment of definitions taken from different dictionaries that could be associated to the same concept although they may have different labels. Th...
Laura Diosan, Alexandrina Rogozan, Jean-Pierre P&e...
A typical collection of personal information contains many documents and mentions many concepts (e.g., person names, events, etc.). In this environment, associative browsing betwe...
Jinyoung Kim, Anton Bakalov, David A. Smith, W. Br...
In this paper, we propose a new similarity measure to compute the pairwise similarity of text-based documents based on suffix tree document model. By applying the new suffix tree ...