Sciweavers

729 search results - page 84 / 146
» And Or Hierarchies and Round Abstraction
Sort
View
SEC
2001
13 years 11 months ago
Communication-Efficient Group Key Agreement
Abstract Traditionally, research in secure group key agreement focuses on minimizing the computational overhead for cryptographic operations, and minimizing the communication overh...
Yongdae Kim, Adrian Perrig, Gene Tsudik
ATAL
2010
Springer
13 years 11 months ago
Argumentative alternating offers
This paper presents an argumentative version of the well known alternating offers negotiation protocol. The negotichanism is based on an abstract preference based argumentation fr...
Nabila Hadidi, Yannis Dimopoulos, Pavlos Moraitis
SIAMCOMP
2008
140views more  SIAMCOMP 2008»
13 years 10 months ago
The Forgetron: A Kernel-Based Perceptron on a Budget
Abstract. The Perceptron algorithm, despite its simplicity, often performs well in online classification tasks. The Perceptron becomes especially effective when it is used in conju...
Ofer Dekel, Shai Shalev-Shwartz, Yoram Singer
JCP
2007
122views more  JCP 2007»
13 years 10 months ago
Converting Group Key Agreement Protocol into Password-Based Setting - Case Study
Abstract— Converting a secure group key agreement protocol into password-based setting is not a trivial task. The security of a password-based scheme hinges on preventing diction...
Ratna Dutta
TON
2008
125views more  TON 2008»
13 years 10 months ago
Two techniques for fast computation of constrained shortest paths
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
Shigang Chen, Meongchul Song, Sartaj Sahni