1806 search results - page 61 / 362 » Some Functions Computable with a Fused-Mac |
168
click to vote
FSTTCS
2004
Springer
15 years 11 months ago
2004
Springer
The join of two sets of facts, E1 and E2, is defined as the set of all facts that are implied independently by both E1 and E2. Congruence closure is a widely used representation f...
153
click to vote
MLQ
2007
15 years 5 months ago
2007
Let ω denote the set of natural numbers. For functions f, g : ω → ω, we say that f is dominated by g if f(n) < g(n) for all but finitely many n ∈ ω. We consider the st...
179
click to vote
ICTAI
1997
IEEE
15 years 9 months ago
1997
IEEE
This paper proposes an optimization algorithm for reducing the power dissipation in a sequential circuit. The encoding of the different states in a Finite State Machine is modifie...
153
click to vote
CRYPTO
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We consider the central cryptographic task of secure twoparty computation, where two parties wish to compute some function of their private inputs (each receiving possibl...
161
click to vote
CRYPTO
2005
Springer
15 years 11 months ago
2005
Springer
In the setting of secure multiparty computation, a set of parties wish to jointly compute some function of their inputs. Such a computation must preserve certain security propertie...