874 search results - page 89 / 175 » Faster Algorithms for Semi-Matching Problems |
ICALP
2003
Springer
15 years 3 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 ...
PAMI
2010
14 years 8 months ago
2010
—In this paper, we present novel techniques that improve the computational and memory efficiency of algorithms for solving multi-label energy functions arising from discrete MRF...
ICCAD
2002
IEEE
15 years 6 months ago
2002
IEEE
Design ECO commonly happens in industry due to constraints or target changes from manufacturing, marketing, reliability, or performance. At each step, designers usually want to mo...
AVSS
2006
IEEE
15 years 4 months ago
2006
IEEE
Background modeling for dynamic scenes is an important problem in the context of real time video surveillance systems. Several nonparametric background models have been proposed t...
ICCV
2007
IEEE
15 years 4 months ago
2007
IEEE
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...