150 search results - page 19 / 30 » Counting Results in Weak Formalisms |
MICCAI
1999
Springer
14 years 1 months ago
1999
Springer
The “Demons Algorithm” in increasingly used for non-rigid registration of 3D medical images. However, if it is fast and usually accurate, the algorithm is based on intuitive id...
FOSSACS
2006
Springer
14 years 14 days ago
2006
Springer
We extend the propositional dynamic logic PDL of Fischer and Ladner with a restricted kind of recursive programs using the formalism of visibly pushdown automata (Alur, Madhusudan...
WDAG
2000
Springer
14 years 10 days ago
2000
Springer
This paper presents a scalable leader election protocol for large process groups with a weak membership requirement. The underlying network is assumed to be unreliable but characte...
DALT
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. This paper offers a formalization of iterated belief revision for multiagent communication using the logic of communication graphs introduced in [15]. In this study we co...
JDCTA
2010
13 years 3 months ago
2010
Soundness and coercion resistance are the important and intricate security requirements for remote voting protocols. Several formal models of soundness and coercion-resistance hav...