The LETOR website contains three information retrieval datasets used as a benchmark for testing machine learning ideas for ranking. Algorithms participating in the challenge are re...
Let A be the incidence matrix of a set system with m sets and n points, m ≤ n, and let t = tr M, where M = AT A. Finally, let σ = tr M2 be the sum of squares of the elements of ...
Purpose – Web search engines are frequently used by people to locate information on the Internet. However, not all queries have an informational goal. Instead of information, so...
Ashish Kathuria, Bernard J. Jansen, Carolyn Hafern...
Regular expression matching is a key task (and often computational bottleneck) in a variety of software tools and applications. For instance, the standard grep and sed utilities, ...
We present cache-oblivious solutions to two important variants of range searching: range reporting and approximate range counting. Our main contribution is a general approach for ...