Sciweavers

2414 search results - page 232 / 483
» Computing Normal Subgroups
Sort
View
JALC
2006
61views more  JALC 2006»
13 years 10 months ago
Random Polynomial-Time Attacks and Dolev-Yao Models
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 ...
Mathieu Baudet
COLING
2002
13 years 10 months ago
Integrating Linguistic and Performance-Based Constraints for Assigning Phrase Breaks
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...
Michaela Atterer, Ewan Klein
FOCM
2002
83views more  FOCM 2002»
13 years 10 months ago
A Rigorous ODE Solver and Smale's 14th Problem
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...
Warwick Tucker
LOGCOM
2002
105views more  LOGCOM 2002»
13 years 10 months ago
Labelled Tableaux for Nonmonotonic Reasoning: Cumulative Consequence Relations
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...
Alberto Artosi, Guido Governatori, Antonino Rotolo
PRL
1998
98views more  PRL 1998»
13 years 10 months ago
Density propagation for surface tracking
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...
Nigel G. Sharp, Edwin R. Hancock