Sciweavers

142 search results - page 17 / 29
» A Parallel Implementation of the Cylindrical Algebraic Decom...
Sort
View
AINA
2005
IEEE
14 years 1 months ago
Multi-Agent Based Network Management Task Decomposition and Scheduling
The rapid development of Internet makes network management on large-scale network a critical issue. But with the management task of large-scale network becoming more complicated, ...
Bo Liu, Junzhou Luo, Wei Li
ALGORITHMICA
2006
139views more  ALGORITHMICA 2006»
13 years 7 months ago
CONQUEST: A Coarse-Grained Algorithm for Constructing Summaries of Distributed Discrete Datasets
Abstract. In this paper we present a coarse-grained parallel algorithm, CONQUEST, for constructing boundederror summaries of high-dimensional binary attributed data in a distribute...
Jie Chi, Mehmet Koyutürk, Ananth Grama
SPAA
2006
ACM
14 years 1 months ago
Towards automatic parallelization of tree reductions in dynamic programming
Tree contraction algorithms, whose idea was first proposed by Miller and Reif, are important parallel algorithms to implement efficient parallel programs manipulating trees. Desp...
Kiminori Matsuzaki, Zhenjiang Hu, Masato Takeichi
CONCUR
2009
Springer
14 years 2 months ago
Partially-Commutative Context-Free Processes
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...
Wojciech Czerwinski, Sibylle B. Fröschle, Sla...
CGF
2008
227views more  CGF 2008»
13 years 7 months ago
Dynamic Sampling and Rendering of Algebraic Point Set Surfaces
Algebraic Point Set Surfaces (APSS) define a smooth surface from a set of points using local moving least-squares (MLS) fitting of algebraic spheres. In this paper we first revisi...
Gaël Guennebaud, Marcel Germann, Markus H. Gr...