6897 search results - page 231 / 1380 » Parallelization of Modular Algorithms |
181
click to vote
CAP
2010
14 years 9 months ago
2010
We present a probabilistic algorithm to interpolate a sparse multivariate polynomial over a finite field, represented with a black box. Our algorithm modifies the algorithm of Ben...
93
Voted
ICPP
1993
IEEE
15 years 6 months ago
1993
IEEE
Abstract { This paper presents a parallel algorithm for solving the region growing problem based on the split and merge approach. The algorithm was implemented on the CM-2 and the ...
113
Voted
CRYPTO
2010
Springer
15 years 3 months ago
2010
Springer
At the heart of many recent lattice-based cryptographic schemes is a polynomial-time algorithm that, given a `high-quality' basis, generates a lattice point according to a Ga...
IPPS
2007
IEEE
15 years 8 months ago
2007
IEEE
Irregular applications, which rely on pointer-based data structures, are often difficult to parallelize. The inputdependent nature of their execution means that traditional paral...
140
click to vote
STOC
2009
ACM
16 years 3 months ago
2009
ACM
We prove strong lower bounds on integrality gaps of Sherali?Adams relaxations for MAX CUT, Vertex Cover, Sparsest Cut and other problems. Our constructions show gaps for Sherali?A...