32 search results - page 2 / 7 » Maintaining a Large Matching or a Small Vertex Cover |
MFCS
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
SCANGIS
2003
13 years 6 months ago
2003
A multiple representation database contains several geographic datasets defined at different resolutions covering the same area. Objects within the different datasets that repre...
PODS
1993
ACM
13 years 9 months ago
1993
ACM
In this paper we consider the problem of using disk blocks efficiently in searching graphs that are too large to fit in internal memory. Our model allows a vertex to be represented...
JEI
2007
13 years 5 months ago
2007
Window-based correlation algorithms are widely used for stereo matching due to their computational efficiency as compared to global algorithms. In this paper, a multiple window co...
CVPR
2009
IEEE
2009
IEEE
Layered Graph Matching by Composite Cluster Sampling with Collaborative and Competitive Interactions
15 years 13 days ago
This paper studies a framework for matching an unknown
number of corresponding structures in two images
(shapes), motivated by detecting objects in cluttered background
and lear...