Sciweavers

682 search results - page 18 / 137
» Classifying arguments by scheme
Sort
View
TCC
2007
Springer
102views Cryptology» more  TCC 2007»
15 years 3 months ago
Perfect NIZK with Adaptive Soundness
Abstract. This paper presents a very simple and efficient adaptivelysound perfect NIZK argument system for any NP-language. In contrast to recently proposed schemes by Groth, Ostro...
Masayuki Abe, Serge Fehr
ASM
2003
ASM
15 years 2 months ago
Remarks on Turbo ASMs for Functional Equations and Recursion Schemes
The question raised in [15] is answered how to naturally dely used forms of recursion by abstract machines. We show that turbo ASMs as defined in [7] allow one to faithfully refl...
Egon Börger, Tommaso Bolognesi
BMVC
2000
14 years 11 months ago
Face Recognition using the Moving Window Classifier
The Moving Window Classifier(MWC) has previously been proposed as an efficient scheme for text recognition applications. In this paper, the potential of the MWC algorithm in face ...
M. S. Hoque, Michael C. Fairhurst
CCS
2008
ACM
14 years 11 months ago
Security arguments for the UM key agreement protocol in the NIST SP 800-56A standard
The Unified Model (UM) key agreement protocol is an efficient Diffie-Hellman scheme that has been included in many cryptographic standards, most recently in the NIST SP 80056A sta...
Alfred Menezes, Berkant Ustaoglu
BMCBI
2006
180views more  BMCBI 2006»
14 years 9 months ago
Building multiclass classifiers for remote homology detection and fold recognition
Motivation Protein remote homology prediction and fold recognition are central problems in computational biology. Supervised learning algorithms based on support vector machines a...
Huzefa Rangwala, George Karypis