5138 search results - page 941 / 1028 » Randomized Algorithms for 3-SAT |
COMPGEOM
2010
ACM
15 years 4 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...
125
click to vote
ICS
2009
Tsinghua U.
15 years 4 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...
110
click to vote
ANTS
2000
Springer
15 years 4 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...
143
click to vote
INFOCOM
1998
IEEE
15 years 4 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 ...
131
click to vote
DAC
2004
ACM
15 years 3 months ago
2004
ACM
The ability to control the variations in IC fabrication process is rapidly diminishing as feature sizes continue towards the sub-100 nm regime. As a result, there is an increasing...