1272 search results - page 19 / 255 » Approximate Parameterized Matching |
ISAAC
2000
Springer
15 years 1 months ago
2000
Springer
It has been a challenging open problem whether there is a polynomial time approximation algorithm for the Vertex Cover problem whose approximation ratio is bounded by a constant l...
IRAL
2003
ACM
15 years 2 months ago
2003
ACM
Though dynamic programming matching can carry out approximate string matching when there may be deletions or insertions in a document, its effectiveness and efficiency are usuall...
RT
2000
Springer
15 years 1 months ago
2000
Springer
Synthetic images can be parameterized by more than time or viewpoint. We generalize image-based rendering by exploiting texture-mapping graphics hardware to decompress ray-traced ...
AAAI
2008
14 years 11 months ago
2008
We argue that parameterized complexity is a useful tool with which to study global constraints. In particular, we show that many global constraints which are intractable to propag...
111
click to vote
CVPR
2004
IEEE
15 years 11 months ago
2004
IEEE
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...