738 search results - page 7 / 148 » Prime Implicant Computation Using Satisfiability Algorithms |
107
click to vote
GLVLSI
2007
IEEE
15 years 3 months ago
2007
IEEE
This paper presents a pipelined architecture of a modular Montgomery multiplier, which is suitable to be used in public key coprocessors. Starting from a baseline implementation o...
102
click to vote
PKC
2005
Springer
15 years 5 months ago
2005
Springer
We develop a method for generating shared, secret, safe primes applicable to use in threshold RSA signature schemes such as the one developed by Shoup. We would like a scheme usabl...
DCC
2004
IEEE
15 years 11 months ago
2004
IEEE
In this paper, we describe a solution to the register synthesis problem for a class of sequence generators known as Algebraic Feedback Shift Registers. These registers are based o...
PKDD
1999
Springer
15 years 4 months ago
1999
Springer
We describe the problem of mining possibilistic set-valued rules in large relational tables containing categorical attributes taking a finite number of values. An example of such a...
IJFCS
2008
14 years 11 months ago
2008
We present GLinClosure, a graded extension of the well-known LinClosure algorithm. GLinClosure can be used to compute degrees of semantic entailment from sets of fuzzy attribute i...