2414 search results - page 232 / 483 » Computing Normal Subgroups |
JALC
2006
15 years 2 months ago
2006
In this paper we present an extension of Dolev-Yao models for security protocols with a notion of random polynomial-time (Las Vegas) computability. First we notice that Dolev-Yao ...
103
click to vote
COLING
2002
15 years 1 months ago
2002
The mapping between syntactic structure and prosodic structure is a widely discussed topic in linguistics. In this work we use insights gained from research on syntax-to-prosody m...
FOCM
2002
15 years 1 months ago
2002
We present an algorithm for computing rigorous solutions to a large class of ordinary differential equations. The main algorithm is based on a partitioning process and the use of i...
112
click to vote
LOGCOM
2002
15 years 1 months ago
2002
In this paper we present a labelled proof method for computing nonmonotonic consequence relations in a conditional logic setting. The method exploits the strong connection between...
102
click to vote
PRL
1998
15 years 1 months ago
1998
This paper describes a novel approach to surface tracking in volumetric image stacks. It draws on a statistical model of the uncertainties inherent in the characterisation of feat...