5115 search results - page 931 / 1023 » On Randomized Lanczos Algorithms |
141
click to vote
INFOCOM
2002
IEEE
15 years 11 months ago
2002
IEEE
— High-aggregate bandwidth switches are those whose port count multiplied by the operating line rate is very high; for example, a 30 port switch operating at 40 Gbps or a 1000 po...
159
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
We study the problem of computing the similarity between two piecewise-linear bivariate functions defined over a common domain, where the surfaces they define in 3D—polyhedral...
192
click to vote
ICS
2009
Tsinghua U.
15 years 10 months ago
2009
Tsinghua U.
New static source routing algorithms for High Performance Computing (HPC) are presented in this work. The target parallel architectures are based on the commonly used fattree netw...
173
click to vote
ANTS
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. Essentially all subexponential time algorithms for the discrete logarithm problem over nite elds are based on the index calculus idea. In proposing cryptosystems based on...
226
click to vote
INFOCOM
1998
IEEE
15 years 10 months ago
1998
IEEE
We present the Informed-Source Coding-On-Demand (ISCOD) approach for efficiently supplying non-identical data from a central server to multiple caching clients through a broadcast ...