We consider the following fundamental scheduling problem. The input consists of n jobs to be scheduled on a set of machines of bounded capacities. Each job is associated with a re...
Marching Ridges is an algorithm for finding ridges of measurement functions defined for images, in which the ridges are defined as level sets of first derivatives of the measureme...
Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) with only...
Alin Dobra, Minos N. Garofalakis, Johannes Gehrke,...
We describe a general technique for converting an online algorithm B to a truthtelling mechanism. We require that the original online competitive algorithm has certain "nicen...
The r-parity tensor of a graph is a generalization of the adjacency matrix, where the tensor’s entries denote the parity of the number of edges in subgraphs induced by r distinc...