Many unsupervised learning algorithms make use of kernels that rely on the Euclidean distance between two samples. However, the Euclidean distance is optimal for Gaussian distribut...
Karim T. Abou-Moustafa, Mohak Shah, Fernando De la...
—Massively parallel scientific applications, running on extreme-scale supercomputers, produce hundreds of terabytes of data per run, driving the need for storage solutions to im...
Ramya Prabhakar, Sudharshan S. Vazhkudai, Youngjae...
We present a novel variant of the RANSAC algorithm
that is much more efficient, in particular when dealing with
problems with low inlier ratios. Our algorithm assumes
that there...
Our paper has two main contributions. Firstly, it presents a model for image sequences motivated by an image encoding perspective. It models accreted regions, where objects appear...
We consider the problem of choosing, sequentially, a map which assigns elements of a set A to a few elements of a set B. On each round, the algorithm suffers some cost associated ...
Alexander Rakhlin, Jacob Abernethy, Peter L. Bartl...