37 search results - page 3 / 8 » Distinguishability of Locally Finite Trees |
MICCAI
1999
Springer
13 years 10 months ago
1999
Springer
We present a new approach for the computation of the deformation field between three dimensional (3D) images. The deformation field minimizes the sum of the squared differences b...
JOIN
2006
13 years 5 months ago
2006
Reputation mechanisms for detecting and punishing free-riders in ad hoc networks depend on the local detection of selfish behavior. Although naive selfish strategies based on drop...
ENTCS
2002
13 years 5 months ago
2002
Solvers on finite domains use local consistency notions to remove values from the domains. This paper defines value withdrawal explanations. Domain reduction is formalized with ch...
ACL
2010
13 years 3 months ago
2010
Learning a tree substitution grammar is very challenging due to derivational ambiguity. Our recent approach used a Bayesian non-parametric model to induce good derivations from tr...
IANDC
2011
13 years 23 days ago
2011
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...