1438 search results - page 7 / 288 » A general formalism for the analysis of distributed algorith... |
COLING
1996
13 years 8 months ago
1996
Automatic compilation of the linking relation employed in certain parsing algorithms for context-free languages is examined. Special problems arise in the extension of these algor...
ARTS
1999
Springer
13 years 11 months ago
1999
Springer
In this paper we show how quantitative program logic [14] provides a formal framework in which to promote standard techniques of program analysis to a context where probability and...
IJCAI
2003
13 years 8 months ago
2003
With the growing use of distributed information networks, there is an increasing need for algorithmic and system solutions for data-driven knowledge acquisition using distributed,...
TIT
2002
13 years 6 months ago
2002
Generalization bounds depending on the margin of a classifier are a relatively recent development. They provide an explanation of the performance of state-of-the-art learning syste...
FORTE
2003
13 years 8 months ago
2003
Abstract. This paper describes the analysis of Pull-Based Asynchronous Rekeying Framework (ARF), a recently proposed solution to the scalable group key management problem in secure...