4767 search results - page 448 / 954 » Structures for Abstract Rewriting |
187
click to vote
MICCAI
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Deformable image registration in the presence of considerable contrast differences and large-scale size and shape changes represents a significant challenge for image r...
219
click to vote
ATAL
2011
Springer
14 years 6 months ago
2011
Springer
Researchers in the field of multiagent sequential decision making have commonly used the terms “weakly-coupled” and “loosely-coupled” to qualitatively classify problems i...
209
click to vote
PPOPP
2012
ACM
14 years 2 months ago
2012
ACM
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
203
click to vote
EMSOFT
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. We classify component-based models of computation into component models and interface models. A component model speci es for each component how the component behaves in a...
224
click to vote
TPHOL
2008
IEEE
16 years 1 months ago
2008
IEEE
g to the well-known “LCF approach” of secure inferences as abstract datatype constructors in ML [16]; explicit proof terms are also available [8]. Isabelle/Isar provides sophis...