1646 search results - page 173 / 330 » fast 2007 |
147
click to vote
DCC
2007
IEEE
16 years 3 months ago
2007
IEEE
Abstract. We present a general technique for the efficient computation of pairings on supersingular Abelian varieties. This formulation, which we call the eta pairing, generalises ...
140
click to vote
DCC
2007
IEEE
16 years 3 months ago
2007
IEEE
We study the detection performance of large scale sensor networks, configured as trees with bounded height, in which information is progressively compressed as it moves towards th...
132
click to vote
ICCD
2007
IEEE
16 years 1 months ago
2007
IEEE
This paper presents a novel transformation technique that can derive various fast Fourier transform (FFT) in a unified paradigm. The proposed algorithm is to find a common twiddle...
175
click to vote
ACSC
2007
IEEE
15 years 10 months ago
2007
IEEE
Tries are the fastest tree-based data structures for managing strings in-memory, but are space-intensive. The burst-trie is almost as fast but reduces space by collapsing trie-cha...
122
click to vote
ASYNC
2007
IEEE
15 years 10 months ago
2007
IEEE
A high data rate asynchronous bit-serial link for long-range on-chip communication is presented. The data bit cycle time is equal to a single gate delay, enabling 67Gbps throughpu...