204 search results - page 16 / 41 » Powered Tate Pairing Computation |
141
click to vote
SBACPAD
2003
IEEE
15 years 11 months ago
2003
IEEE
Comparison of the DNA sequences and genes of two genomes can be useful to investigate the common functionalities of the corresponding organisms and get a better understanding of h...
150
click to vote
PODC
2004
ACM
15 years 11 months ago
2004
ACM
We explore the computational power of networks of small resource-limited mobile agents. We define two new models of computation based on pairwise interactions of finite-state ag...
145
click to vote
PODC
2010
ACM
15 years 10 months ago
2010
ACM
: The Borowsky-Gafni (BG) simulation algorithm is a powerful reduction algorithm that shows that t-resilience of decision tasks can be fully characterized in terms of wait-freedom....
143
click to vote
VLSID
2004
IEEE
16 years 6 months ago
2004
IEEE
{A new low-power design method produces CMOS circuits that consume the least dynamic power at the highest speed permitted under the technology constraint. A gate is characterized b...
187
click to vote
APCSAC
2007
IEEE
16 years 11 days ago
2007
IEEE
In this paper, a runtime performance projection model for dynamic power management is proposed. The model is built as a first-order linear equation using a linear regression model....