2745 search results - page 343 / 549 » A fast algorithm for computing large Fibonacci numbers |
162
Voted
MM
2004
ACM
15 years 11 months ago
2004
ACM
One of the prime reasons movie and music studios have ignored the Internet for open-networked multimedia content delivery, has been the lack of a technology that can support a sec...
166
click to vote
FC
1997
Springer
15 years 10 months ago
1997
Springer
Abstract. SPEED is a private key block cipher. It supports three variable parameters: (1) data length — the length of a plaintext/ciphertext of SPEED can be 64, 128 or 256 bits. ...
138
Voted
MOBICOM
2006
ACM
16 years 3 days ago
2006
ACM
Determining node positions is essential for many next-generation network functionalities. Previous localization algorithms lack correctness guarantees or require network density h...
175
Voted
VLDB
1997
ACM
15 years 9 months ago
1997
ACM
A new access method, called M-tree, is proposed to organize and search large data sets from a generic "metric space", i.e. where object proximity is only defined by a di...
165
click to vote
ICS
2005
Tsinghua U.
15 years 11 months ago
2005
Tsinghua U.
BlueGene/L is currently the world’s fastest supercomputer. It consists of a large number of low power dual-processor compute nodes interconnected by high speed torus and collect...