168 search results - page 9 / 34 » Matching as a non-cooperative game |
EMMCVPR
2001
Springer
15 years 2 months ago
2001
Springer
—Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an associati...
LICS
2007
IEEE
15 years 3 months ago
2007
IEEE
Higher-order matching is the problem given t = u where t, u are terms of simply typed λ-calculus and u is closed, is there a substitution θ such that tθ and u have the same nor...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
Abstract. We prove an n-exptime lower bound for the problem of deciding the winner in a reachability game on Higher Order Pushdown Automata (HPDA) of level n. This bound matches th...
ICPR
2010
IEEE
14 years 8 months ago
2010
IEEE
In this paper we introduce a robust matching technique that allows to operate a very accurate selection of corresponding feature points from multiple views. Robustness is achieved...
114
click to vote
3DIM
2011
IEEE
13 years 9 months ago
2011
IEEE
Abstract—During the last few years a wide range of algorithms and devices have been made available to easily acquire range images. To this extent, the increasing abundance of dep...