Sciweavers

33 search results - page 6 / 7
» Least Common Subsumption as a connective
Sort
View
CIC
2006
141views Communications» more  CIC 2006»
13 years 9 months ago
Towards the Integration of Reliability and Traffic Engineering
The main goal of this paper is to make a step towards the development of a unified approach that incorporates both reliability and traffic engineering aspects into a common, unifie...
Andras Farago
SP
2010
IEEE
156views Security Privacy» more  SP 2010»
13 years 5 months ago
Round-Efficient Broadcast Authentication Protocols for Fixed Topology Classes
Abstract--We consider resource-constrained broadcast authentication for n receivers in a static, known network topology. There are only two known broadcast authentication protocols...
Haowen Chan, Adrian Perrig
BMCBI
2006
84views more  BMCBI 2006»
13 years 7 months ago
Inferring topology from clustering coefficients in protein-protein interaction networks
Background: Although protein-protein interaction networks determined with high-throughput methods are incomplete, they are commonly used to infer the topology of the complete inte...
Caroline C. Friedel, Ralf Zimmer
CRYPTO
2004
Springer
111views Cryptology» more  CRYPTO 2004»
14 years 29 days ago
Signed Binary Representations Revisited
The most common method for computing exponentiation of random elements in Abelian groups are sliding window schemes, which enhance the efficiency of the binary method at the expens...
Katsuyuki Okeya, Katja Schmidt-Samoa, Christian Sp...
JMLR
2008
169views more  JMLR 2008»
13 years 7 months ago
Multi-class Discriminant Kernel Learning via Convex Programming
Regularized kernel discriminant analysis (RKDA) performs linear discriminant analysis in the feature space via the kernel trick. Its performance depends on the selection of kernel...
Jieping Ye, Shuiwang Ji, Jianhui Chen