88 search results - page 4 / 18 » Regular Cost Functions over Finite Trees |
ICALP
2000
Springer
14 years 1 months ago
2000
Springer
We show the decidability of model checking PA-processes against several first-order logics based upon the reachability predicate. The main tool for this result is the recognizabil...
LPAR
2005
Springer
14 years 3 months ago
2005
Springer
We describe a sound, terminating, and complete matching algorithm for terms built over flexible arity function symbols and context, function, sequence, and individual variables. C...
TCSV
2008
13 years 9 months ago
2008
Many existing techniques for image restoration can be expressed in terms of minimizing a particular cost function. Iterative regularization methods are a novel variation on this th...
NHM
2010
13 years 4 months ago
2010
We propose here a general framework to address the question of trace operators on a dyadic tree. This work is motivated by the modeling of the human bronchial tree which, thanks t...
ICCV
2007
IEEE
14 years 11 months ago
2007
IEEE
The maximum flow algorithm for minimizing energy functions of binary variables has become a standard tool in computer vision. In many cases, unary costs of the energy depend linea...