337 search results - page 49 / 68 » Matching Algorithms Are Fast in Sparse Random Graphs |
CVPR
2012
IEEE
11 years 11 months ago
2012
IEEE
Top-down visual saliency facilities object localization by providing a discriminative representation of target objects and a probability map for reducing the search space. In this...
WWW
2005
ACM
14 years 9 months ago
2005
ACM
RDF is increasingly being used to represent metadata. RDF Site Summary (RSS) is an application of RDF on the Web that has considerably grown in popularity. However, the way RSS sy...
ICCV
2007
IEEE
14 years 11 months ago
2007
IEEE
We pose robust matching with parametric and non-parametric constraints as the problem of finding a stable independent set (SIS) in an oriented graph whose vertices are all possible...
KDD
2005
ACM
14 years 9 months ago
2005
ACM
The problem of finding frequent patterns from graph-based datasets is an important one that finds applications in drug discovery, protein structure analysis, XML querying, and soc...
IROS
2007
IEEE
14 years 3 months ago
2007
IEEE
Abstract— We present the Binocular Sparse Feature Segmentation (BSFS) algorithm for vision-based person following with a mobile robot. BSFS uses Lucas-Kanade feature detection an...