88 search results - page 8 / 18 » Sublinear Algorithms for Parameterized Matching |
VMV
2000
14 years 10 months ago
2000
In this paper the problem of matching freeform surface features against measured point data is studied. The motivation for this investigation is the recent demand for fast and rob...
100
click to vote
WG
2009
Springer
15 years 4 months ago
2009
Springer
We study the parameterized complexity of several minimum label graph problems, in which we are given an undirected graph whose edges are labeled, and a property Π, and we are ask...
CVGIP
2006
14 years 9 months ago
2006
This paper presents a system for rapid editing of highly dynamic motion capture data. At the heart of this system is an optimization algorithm that can transform the captured moti...
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
In many retrieval, object recognition and wide baseline stereo methods, correspondences of interest points are established possibly sublinearly by matching a compact descriptor su...
ICALP
2003
Springer
15 years 2 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...