2157 search results - page 113 / 432 » Optimal Fast Hashing |
147
click to vote
INFOVIS
2002
IEEE
15 years 9 months ago
2002
IEEE
We present an extremely fast graph drawing algorithm for very large graphs, which we term ACE (for Algebraic multigrid Computation of Eigenvectors). ACE exhibits an improvement of...
141
click to vote
SEAL
1998
Springer
15 years 8 months ago
1998
Springer
Most of the obstacle avoidance techniques do not consider the robot orientation or its nal angle at the target position. These techniques deal with the robot position only and are ...
137
click to vote
ASPDAC
2009
ACM
15 years 8 months ago
2009
ACM
The number of vias generated during the global routing stage is a critical factor for the yield of final circuits. However, most global routers only approach the problem by chargin...
155
click to vote
GD
2000
Springer
15 years 8 months ago
2000
Springer
We present a multi-scale layout algorithm for the aesthetic drawing of undirected graphs with straight-line edges. The algorithm is extremely fast, and is capable of drawing graph...
132
click to vote
CRYPTO
1995
Springer
15 years 8 months ago
1995
Springer
The Diffie-Hellman key exchange algorithm can be implemented using the group of points on an elliptic curve over the field F2n. A software version of this using n = 155 can be o...