6105 search results - page 285 / 1221 » A Parallel Algorithm for Bound-Smoothing |
174
click to vote
ISSAC
2007
Springer
16 years 24 days ago
2007
Springer
It is only in the last five years that researchers have begun to use disk-based search techniques on a large scale. The primary examples of its use come from symbolic algebra and...
139
click to vote
COMPSAC
2005
IEEE
16 years 9 days ago
2005
IEEE
Parallel changes are a basic fact of modern software development. Where previously we looked at prima facie interference, here we investigate a less direct form that we call seman...
218
Voted
PDCAT
2004
Springer
16 years 19 hour ago
2004
Springer
Abstract. Agent-based simulation of large multicellular biological systems has become a viable option owing to affordable parallel computers, such as Beowulf-style clusters. We de...
160
click to vote
IPPS
1999
IEEE
15 years 11 months ago
1999
IEEE
We present a coarse grained parallel algorithm for computing a maximum matching in a convex bipartite graph G = A;B;E. For p processors with N=p memory per processor, N = jAj+jBj,...
173
Voted
STOC
1995
ACM
15 years 10 months ago
1995
ACM
We show that a parallel repetition of any two-prover one-round proof system (MIP(2, 1)) decreases the probability of error at an exponential rate. No constructive bound was previou...