6437 search results - page 196 / 1288 » Parallel Algorithms for Arrangements |
111
click to vote
IPPS
1999
IEEE
15 years 7 months ago
1999
IEEE
A central problem in massively parallel computing is efficiently routing data between processors. This problem is complicated by two considerations. First, in any massively parall...
120
click to vote
IPPS
2000
IEEE
15 years 7 months ago
2000
IEEE
Parallel solution of irregular problems require solving the graph partitioning problem. The extended eigenproblem appears as the solution of some relaxed formulations of the graph ...
132
click to vote
ISAAC
2005
Springer
15 years 8 months ago
2005
Springer
In an orthogonal drawing of a planar graph G, each vertex is drawn as a point, each edge is drawn as a sequence of alternate horizontal and vertical line segments, and any two edge...
129
click to vote
COLOGNETWENTE
2008
15 years 4 months ago
2008
In this paper we consider the online scheduling of jobs, which require processing on a number of machines simultaneously. These jobs are presented to a decision maker one by one, ...
162
click to vote
ASAP
2006
IEEE
15 years 9 months ago
2006
IEEE
Massively parallel processor array architectures can be used as hardware accelerators for a plenty of dataflow dominant applications. Bilateral filtering is an example of a stat...