Sciweavers

769 search results - page 62 / 154
» Where Is the Proof
Sort
View
JSYML
2006
85views more  JSYML 2006»
13 years 8 months ago
An alternative semantics for quantified relevant logic
The quantified relevant logic RQ is given a new semantics in which a formula xA is true when there is some true proposition that implies all x-instantiations of A. Formulae are mo...
Robert Goldblatt, Edwin D. Mares
ICML
2007
IEEE
14 years 9 months ago
Exponentiated gradient algorithms for log-linear structured prediction
Conditional log-linear models are a commonly used method for structured prediction. Efficient learning of parameters in these models is therefore an important problem. This paper ...
Amir Globerson, Terry Koo, Xavier Carreras, Michae...
ASIACRYPT
2001
Springer
14 years 1 months ago
Provably Secure Fair Blind Signatures with Tight Revocation
A fair blind signature scheme allows the trustee to revoke blindness so that it provides authenticity and anonymity to honest users while preventing malicious users from abusing th...
Masayuki Abe, Miyako Ohkubo
FSE
2003
Springer
115views Cryptology» more  FSE 2003»
14 years 2 months ago
OMAC: One-Key CBC MAC
In this paper, we present One-key CBC MAC (OMAC) and prove its security for arbitrary length messages. OMAC takes only one key, K (k bits) of a block cipher E. Previously, XCBC req...
Tetsu Iwata, Kaoru Kurosawa
CORR
2010
Springer
83views Education» more  CORR 2010»
13 years 6 months ago
List Factoring and Relative Worst Order Analysis
Relative worst order analysis is a supplement or alternative to competitive analysis which has been shown to give results more in accordance with observed behavior of online algori...
Martin R. Ehmsen, Jens S. Kohrt, Kim S. Larsen