Sciweavers

294 search results - page 21 / 59
» Efficient Confirmer Signatures from the
Sort
View
EMNLP
2008
13 years 11 months ago
Better Binarization for the CKY Parsing
We present a study on how grammar binarization empirically affects the efficiency of the CKY parsing. We argue that binarizations affect parsing efficiency primarily by affecting ...
Xinying Song, Shilin Ding, Chin-Yew Lin
WAIFI
2010
Springer
158views Mathematics» more  WAIFI 2010»
13 years 7 months ago
On the Efficiency and Security of Pairing-Based Protocols in the Type 1 and Type 4 Settings
Abstract. We focus on the implementation and security aspects of cryptographic protocols that use Type 1 and Type 4 pairings. On the implementation front, we report improved timing...
Sanjit Chatterjee, Darrel Hankerson, Alfred Meneze...
CSDA
2008
179views more  CSDA 2008»
13 years 10 months ago
A note on adaptive group lasso
Group lasso is a natural extension of lasso and selects variables in a grouped manner. However, group lasso suffers from estimation inefficiency and selection inconsistency. To re...
Hansheng Wang, Chenlei Leng
CORR
2006
Springer
90views Education» more  CORR 2006»
13 years 10 months ago
The recognizability of sets of graphs is a robust property
Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the noti...
Bruno Courcelle, Pascal Weil
CCS
2008
ACM
13 years 12 months ago
Multi-use unidirectional proxy re-signatures
In 1998, Blaze, Bleumer, and Strauss suggested a cryptographic primitive termed proxy re-signature in which a proxy transforms a signature computed under Alice's secret key in...
Benoît Libert, Damien Vergnaud