We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...
We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem under ÐÔ norm, based on Ôstable distributions. Our scheme improves the running...
Mayur Datar, Nicole Immorlica, Piotr Indyk, Vahab ...
We consider the problem of obtaining the approximate maximum a posteriori estimate of a discrete random field characterized by pairwise potentials that form a truncated convex mod...
How to find a cooperative diversity scheme that achieves the transmit diversity bound is still an open problem. In fact, all previously proposed amplify-and-forward (AF) and decod...
act out the core search problem of active learning schemes, to better understand the extent to which adaptive labeling can improve sample complexity. We give various upper and low...