Content-targeted advertising, the task of automatically associating ads to a Web page,
constitutes a key Web monetization strategy nowadays. Further, it introduces new challenging …

A perfect hash function (PHF) h: U →[0,m − 1] for a key set S is a function that maps the keys
of S to unique values. The minimum amount of space to represent a PHF for a given set S is …

We present a fast compression technique for natural language texts. The novelties are that (1)
decompression of arbitrary portions of the text can be done very efficiently, (2) exact …

Despite the recent advances in search quality, the fast increase in the size of the Web collection
has introduced new challenges for Web ranking algorithms. In fact, there are still many …

Recommender systems are quickly becoming ubiquitous in applications such as e-commerce,
social media channels, and content providers, among others, acting as an enabling …

Performing accurate suggestions is an objective of paramount importance for effective
recommender systems. Other important and increasingly evident objectives are novelty and …

We present a method for automatic generate suggestions of related queries submitted to Web
search engines. The method extracts information from the log of past submitted queries to …

This paper studies how link information can be used to improve classification results for Web
collections. We evaluate four different measures of subject similarity, derived from the Web …

Software defects are well-known in software development and might cause several problems
for users and developers aside. As a result, researches employed distinct techniques to …

We present an effective caching scheme that reduces the computing and I/O requirements
of a Web search engine without altering its ranking characteristics. The novelty is a two-level …