Sciweavers

1937 search results - page 221 / 388
» Starting B Specifications from Use Cases
Sort
View
TCS
2010
15 years 1 months ago
Bounds on the efficiency of black-box commitment schemes
Constructions of cryptographic primitives based on general assumptions (e.g., one-way functions) tend to be less efficient than constructions based on specific (e.g., number-theor...
Omer Horvitz, Jonathan Katz
SLOGICA
2008
135views more  SLOGICA 2008»
15 years 6 months ago
A Way to Interpret Lukasiewicz Logic and Basic Logic
Fuzzy logics are in most cases based on an ad-hoc decision about the interpretation of the conjunction. If they are useful or not can typically be found out only by testing them wi...
Thomas Vetterlein
BMCBI
2010
121views more  BMCBI 2010»
15 years 6 months ago
Knowledge-based annotation of small molecule binding sites in proteins
Background: The study of protein-small molecule interactions is vital for understanding protein function and for practical applications in drug discovery. To benefit from the rapi...
Ratna R. Thangudu, Manoj Tyagi, Benjamin A. Shoema...
CORR
1998
Springer
125views Education» more  CORR 1998»
15 years 6 months ago
Automating Coreference: The Role of Annotated Training Data
Wereporthere ona studyof interannotatoragreementin the coreferencetask as defined by the MessageUnderstanding Conference(MUC-6and MUC-7).Basedon feedback from annotators, weclarif...
Lynette Hirschman, Patricia Robinson, John D. Burg...
EUROCRYPT
2012
Springer
13 years 9 months ago
Malleable Proof Systems and Applications
sion of an extended abstract published in Proceedings of Eurocrypt 2012, Springer-Verlag, 2012. Available from the IACR Cryptology ePrint Archive as Report 2012/012. Malleability ...
Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya...