Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
d Abstract] A. C. Gilbert S. Guhay P. Indykz S. Muthukrishnan M. Strauss We give an algorithm for nding a Fourier representation R of B terms for a given discrete signal A of leng...
Anna C. Gilbert, Sudipto Guha, Piotr Indyk, S. Mut...
We introduce a novel data-driven mean-shift belief propagation
(DDMSBP) method for non-Gaussian MRFs, which
often arise in computer vision applications. With the aid
of scale sp...
— We study the inversion of a random field from pointwise measurements collected by a sensor network. We assume that the field has a sparse representation in a known basis. To ...
Abstract— This paper introduces two new tree-based anticollision schemes using multiple feedback symbols for uplink tag random access of emerging radio frequency identification (...