Top-k queries on large multi-attribute data sets are fundamental operations in information retrieval and ranking applications. In this paper, we initiate research on the anytime b...
Benjamin Arai, Gautam Das, Dimitrios Gunopulos, Ni...
Abstract. This paper describes a technique for reducing the querytime cost of HITS-like ranking algorithm. The basic idea is to compute for each node in the web graph a summary of ...
Abstract. We consider the problem of computing additively approximate Nash equilibria in non-cooperative two-player games. We provide a new polynomial time algorithm that achieves ...
We present a computational approach to the saddle-point formulation for the Nash equilibria of two-person, zero-sum sequential games of imperfect information. The algorithm is a ï¬...
— This paper studies load balancing for multipath Internet routing. We focus on hash-based load balancing algorithms that work on the flow level to avoid packet reordering which...