In this paper we propose an inexact spectral matching algorithm that embeds large graphs on a low-dimensional isometric space spanned by a set of eigenvectors of the graph Laplacia...
David Knossow, Avinash Sharma, Diana Mateus, Radu ...
Libraries and other institutions are interested in providing access to scanned versions of their large collections of handwritten historical manuscripts on electronic media. Conve...
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
We address an unsupervised object detection and segmentation problem that goes beyond the conventional assumptions of one-to-one object correspondences or model-test settings betwe...
Minsu Cho (Seoul National University), Young Min S...
We present a novel approach for fast object class recognition incorporating contextual information into boosting. The object is represented as a constellation of generalized corre...