Sciweavers

661 search results - page 8 / 133
» Argument Reduction by Factoring
Sort
View
ICCAD
2004
IEEE
121views Hardware» more  ICCAD 2004»
14 years 5 months ago
Factoring and eliminating common subexpressions in polynomial expressions
Polynomial expressions are used to compute a wide variety of mathematical functions commonly found in signal processing and graphics applications, which provide good opportunities...
Anup Hosangadi, Farzan Fallah, Ryan Kastner
ATAL
2006
Springer
14 years 7 days ago
Adaptive agent negotiation via argumentation
In this paper, we study how argumentation can be used as a basis for negotiation between autonomous agents, where negotiation strategies of the different parties are represented a...
Antonis C. Kakas, Pavlos Moraitis
CORR
2010
Springer
108views Education» more  CORR 2010»
13 years 8 months ago
Inverting a permutation is as hard as unordered search
We describe a reduction from the problem of unordered search (with a unique solution) to the problem of inverting a permutation. Since there is a straightforward reduction in the ...
Ashwin Nayak
ASIACRYPT
2003
Springer
14 years 1 months ago
Some RSA-Based Encryption Schemes with Tight Security Reduction
In this paper, we study some RSA-based semantically secure encryption schemes (IND-CPA) in the standard model. We first derive the exactly tight one-wayness of Rabin-Paillier encr...
Kaoru Kurosawa, Tsuyoshi Takagi
IJCAI
1997
13 years 9 months ago
Reasoning Symbolically About Partially Matched Cases
In teaching case-based argumentation skills, the CATO program, an intelligent learning environment, guides students' assessments of partial matches between problems and cases...
Kevin D. Ashley, Vincent Aleven