1862 search results - page 5 / 373 » Constrained pattern matching |
SIAMJO
2002
14 years 9 months ago
2002
We give a pattern search method for nonlinearly constrained optimization that is an adaption of a bound constrained augmented Lagrangian method first proposed by Conn, Gould, and T...
ICPR
2004
IEEE
15 years 10 months ago
2004
IEEE
This study addresses the problem of finding correspondences for wide baseline stereo. Texture has traditionally been utilised as a single-image cue for 3D shape reconstruction (sh...
COMPGEOM
1999
ACM
15 years 1 months ago
1999
ACM
In this paper, we undertake a performance study of some recent algorithms for geometric pattern matching. These algorithms cover two general paradigms for pattern matching; alignm...
ISAAC
2001
Springer
15 years 1 months ago
2001
Springer
A fragmentary pattern is a multiset of non-empty strings, and it matches a string w if all the strings in it occur within w without any overlaps. We study some fundamental issues o...
101
click to vote
ICALP
2011
Springer
14 years 25 days ago
2011
Springer
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...