Sciweavers

1818 search results - page 151 / 364
» Granularity-Adaptive Proof Presentation
Sort
View
ASIACRYPT
2000
Springer
15 years 10 months ago
Round-Efficient Conference Key Agreement Protocols with Provable Security
A conference key protocol allows a group of participants to establish a secret communication (conference) key so that all their communications thereafter are protected by the key. ...
Wen-Guey Tzeng, Zhi-Jia Tzeng
MCS
2000
Springer
15 years 10 months ago
Analysis of a Fusion Method for Combining Marginal Classifiers
The use of multiple features by a classifier often leads to a reduced probability of error, but the design of an optimal Bayesian classifier for multiple features is dependent on t...
Mark D. Happel, Peter Bock
COMPGEOM
1995
ACM
15 years 10 months ago
A New Technique for Analyzing Substructures in Arrangements
We present a simple but powerful new probabilistic technique for analyzing the combinatorial complexity of various substructures in arrangements of piecewise-linear surfaces in hig...
Boaz Tagansky
ZUM
2000
Springer
107views Formal Methods» more  ZUM 2000»
15 years 10 months ago
How to Drive a B Machine
The B-Method is a state-based formal method that describes behaviour in terms of MACHINES whose states change under OPERATIONS. The process algebra CSP is an event-based formalism ...
Helen Treharne, Steve Schneider
FSTTCS
1991
Springer
15 years 10 months ago
Randomizing Reductions of Search Problems
This paper closes a gap in the foundations of the theory of average case complexity. First, we clarify the notion of a feasible solution for a search problem and prove its robustne...
Andreas Blass, Yuri Gurevich