Sciweavers

6437 search results - page 292 / 1288
» Parallel Algorithms for Arrangements
Sort
View
129
Voted
ISSAC
2007
Springer
121views Mathematics» more  ISSAC 2007»
15 years 9 months ago
A comparative analysis of parallel disk-based Methods for enumerating implicit graphs
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...
Eric Robinson, Daniel Kunkle, Gene Cooperman
99
Voted
COMPSAC
2005
IEEE
15 years 9 months ago
Parallel Changes: Detecting Semantic Interferences
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...
G. Lorenzo Thione, Dewayne E. Perry
PDCAT
2004
Springer
15 years 9 months ago
Parallel Computing Platform for the Agent-Based Modeling of Multicellular Biological Systems
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...
Toh Da-Jun, Francis Tang, Travis Lee, Deepak Sarda...
121
Voted
IPPS
1999
IEEE
15 years 8 months ago
Coarse Grained Parallel Maximum Matching In Convex Bipartite Graphs
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,...
Prosenjit Bose, Albert Chan, Frank K. H. A. Dehne,...
123
Voted
STOC
1995
ACM
108views Algorithms» more  STOC 1995»
15 years 7 months ago
A parallel repetition theorem
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...
Ran Raz