13752 search results - page 106 / 2751 » Parallel and Distributed Haskells |
IPPS
2007
IEEE
15 years 9 months ago
2007
IEEE
127
click to vote
IPPS
2000
IEEE
15 years 7 months ago
2000
IEEE
Consider any known sequential algorithm for matrix multiplication over an arbitrary ring with time complexity O N , where 2 3. We show that such an algorithm can be parallelize...
133
click to vote
IPPS
2002
IEEE
15 years 8 months ago
2002
IEEE
Sort can be speeded up on parallel computers by dividing and computing data individually in parallel. Merge sort can be parallelized, however, the conventional algorithm implement...
229
click to vote
APDC
1997
15 years 4 months ago
1997
Delaunaytriangulationhas beenmuchusedin suchapplicationsas volumerendering, shape representation, terrain modeling and so on. The main disadvantage of Delaunay triangulationis lar...
ICPADS
1997
IEEE
15 years 7 months ago
1997
IEEE
