A word at a time: computing word relatedness using temporal semantic analysis

K Radinsky, E Agichtein, E Gabrilovich… - Proceedings of the 20th …, 2011 - dl.acm.org
Computing the degree of semantic relatedness of words is a key functionality of many
language applications such as search, clustering, and disambiguation. Previous …

Memory-efficient assembly using Flye

B Freire, S Ladra, JR Parama - IEEE/ACM Transactions on …, 2021 - ieeexplore.ieee.org
In the past decade, next-generation sequencing (NGS) enabled the generation of genomic
data in a cost-effective, high-throughput manner. The most recent third-generation …

Temporal information retrieval

N Kanhabua, A Anand - Proceedings of the 39th International ACM …, 2016 - dl.acm.org
The study of temporal dynamics and its impact can be framed within the so-called temporal
IR approaches, which explain how user behavior, document content and scale vary with …

Universal indexes for highly repetitive document collections

F Claude, A Fariña, MA Martínez-Prieto, G Navarro - Information Systems, 2016 - Elsevier
Indexing highly repetitive collections has become a relevant problem with the emergence of
large repositories of versioned documents, among other applications. These collections may …

Using the past to score the present: Extending term weighting models through revision history analysis

A Aji, Y Wang, E Agichtein, E Gabrilovich - Proceedings of the 19th ACM …, 2010 - dl.acm.org
The generative process underlies many information retrieval models, notably statistical
language models. Yet these models only examine one (current) version of the document …

[PDF][PDF] Durable top-k search in document archives

U Leong Hou, N Mamoulis, K Berberich… - Proceedings of the …, 2010 - homepages.cwi.nl
We propose and study a new ranking problem in versioned databases. Consider a database
of versioned objects which have different valid instances along a history (eg, documents in a …

Index maintenance for time-travel text search

A Anand, S Bedathur, K Berberich… - Proceedings of the 35th …, 2012 - dl.acm.org
Time-travel text search enriches standard text search by temporal predicates, so that users
of web archives can easily retrieve document versions that are considered relevant to a …

Document retrieval on repetitive string collections

T Gagie, A Hartikainen, K Karhu, J Kärkkäinen… - Information Retrieval …, 2017 - Springer
Most of the fastest-growing string collections today are repetitive, that is, most of the
constituent documents are similar to many others. As these collections keep growing, a key …

Temporal index sharding for space-time efficiency in archive search

A Anand, S Bedathur, K Berberich… - Proceedings of the 34th …, 2011 - dl.acm.org
Time-travel queries that couple temporal constraints with keyword queries are useful in
searching large-scale archives of time-evolving content such as the web archives or wikis …

Improved index compression techniques for versioned document collections

J He, J Zeng, T Suel - Proceedings of the 19th ACM international …, 2010 - dl.acm.org
Current Information Retrieval systems use inverted index structures for efficient query
processing. Due to the extremely large size of many data sets, these index structures are …