Nowadays, in information systems such as web search engines and databases, diversity is
becoming increasingly essential and getting more and more attention for improving users' …

Understanding user intent is key to designing an effective ranking system in a search
engine. In the absence of any explicit knowledge of user intent, search engines want to …

Data similarity (or distance) computation is a fundamental research topic which underpins
many high-level applications based on similarity measures in machine learning and data …

Motivation Sequence alignment is a central operation in bioinformatics pipeline and, despite
many improvements, remains a computationally challenging problem. Locality-sensitive …

Consistent Weighted Sampling Page 1 Consistent Weighted Sampling Mark Manasse
Microsoft Research, SVC manasse@microsoft.com Frank McSherry Microsoft Research, SVC …

Estimating set similarity is a central problem in many computer applications. In this paper we
introduce the Odd Sketch, a compact binary sketch for estimating the Jaccard similarity of …

Weighted minwise hashing (WMH) is one of the fundamental subroutine, required by many
celebrated approximation algorithms, commonly adopted in industrial practice for large …

Efficiently computing the weighted Jaccard similarity has become an active research topic in
machine learning and theory. For sparse data, the standard technique is based on the …

Minwise hashing has become a standard tool to calculate signatures which allow direct
estimation of Jaccard similarities. While very efficient algorithms already exist for the …

In many search applications related to passage retrieval, text entailment, and subgraph
search, the query and each'document'is a set of elements, with a document being relevant if …