The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
In this paper we give approximation algorithms for several proximity problems in high dimensional spaces. In particular, we give the rst Las Vegas data structure for (1 + )-neares...
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...
— Quasirandom or low discrepancy sequences, such as the Van der Corput, Sobol, Faure, Halton (named after their inventors) etc. are less random than a pseudorandom number sequenc...