Let G = G(n, r) be a random geometric graph resulting from placing n nodes uniformly at random in the unit square (disk) and connecting every two nodes if and only if their Euclide...
Markov Random Fields (MRFs) are ubiquitous in lowlevel computer vision. In this paper, we propose a new approach to the optimization of multi-labeled MRFs. Similarly to -expansion...
In this paper, we exploit a novel ranking mechanism that processes query samples with noisy labels, motivated by the practical application of web image search re-ranking where the...
We design two different strategies for computing the unknown content preferences in an online social network based on a small set of nodes in the corresponding social graph for wh...
We propose an algorithm for detecting bridges and estimating geodesic distances from a set of noisy samples of an underlying manifold. Finding geodesics on a nearest neighbors gra...