Missing data is a widespread problem that can affect the ability to use data to construct effective prediction systems. We investigate a common machine learning technique that can...
Qinbao Song, Martin J. Shepperd, Xiangru Chen, Jun...
We consider the following problem: given an unsorted array of n elements, and a sequence of intervals in the array, compute the median in each of the subarrays defined by the inter...
In the CLOSEST SUBSTRING problem k strings s1, ..., sk are given, and the task is to find a string s of length L such that each string si has a consecutive substring of length L ...
We present new combinatorial approximation algorithms for k-set cover. Previous approaches are based on extending the greedy algorithm by efficiently handling small sets. The new a...
Stavros Athanassopoulos, Ioannis Caragiannis, Chri...
We settle the 1-pass space complexity of (1 ? )approximating the Lp norm, for real p with 1 p 2, of a length-n vector updated in a length-m stream with updates to its coordinate...