7197 search results - page 225 / 1440 » On the computational power of BlenX |
142
click to vote
CARDIS
2010
Springer
16 years 1 months ago
2010
Springer
In this paper we describe a simple protocol for secure delegation of the elliptic-curve pairing. A computationally limited device (typically a smart-card) will delegate the computa...
161
click to vote
IPPS
2006
IEEE
16 years 19 days ago
2006
IEEE
Granularity control is an effective means for trading power consumption with performance on dense shared memory multiprocessors, such as multi-SMT and multi-CMP systems. In this p...
118
click to vote
ENTCS
2008
15 years 6 months ago
2008
In this note we give a new representation for closed sets under which the robust zero set of a function is computable. We call this representation the component cover representati...
158
click to vote
JSC
2006
15 years 6 months ago
2006
We propose fast algorithms for computing composed products and composed sums, as well as diamond products of univariate polynomials. These operations correspond to special multiva...
153
click to vote
APAL
2010
15 years 6 months ago
2010
The computable Lipschitz reducibility was introduced by Downey, Hirschfeldt and LaForte under the name of strong weak truthtable reducibility [6]. This reducibility measures both t...