Sciweavers

1302 search results - page 57 / 261
» On the Strong Chromatic Number
Sort
View
ASIACRYPT
2007
Springer
16 years 17 days ago
Fully Anonymous Group Signatures Without Random Oracles
We construct a new group signature scheme using bilinear groups. The group signature scheme is practical, both keys and group signatures consist of a constant number of group elem...
Jens Groth
ACL
2010
15 years 4 months ago
Sparsity in Dependency Grammar Induction
A strong inductive bias is essential in unsupervised grammar induction. We explore a particular sparsity bias in dependency grammars that encourages a small number of unique depen...
Jennifer Gillenwater, Kuzman Ganchev, João ...
FSE
2008
Springer
105views Cryptology» more  FSE 2008»
15 years 8 months ago
An Improved Security Bound for HCTR
HCTR was proposed by Wang, Feng and Wu in 2005. It is a mode of operation which provides a tweakable strong pseudorandom permutation. Though HCTR is quite an efficient mode, the au...
Debrup Chakraborty, Mridul Nandi
COMBINATORICA
2008
123views more  COMBINATORICA 2008»
15 years 5 months ago
Counting canonical partitions in the random graph
Algorithms are given for computing the number of n-element diagonal sets and the number of n-element strongly diagonal sets of binary sequences of length at most 2n - 2. The first...
Jean A. Larson
OOPSLA
1998
Springer
15 years 10 months ago
How to Preserve the Benefits of Design Patterns
The rapid evolution of Design Patterns has hampered the benefits gained from using Design Patterns. The increase in the number of Design Patterns makes a common vocabulary unmanag...
Ellen Agerbo, Aino Cornils