Sciweavers

6129 search results - page 173 / 1226
» A parallel LLL algorithm
Sort
View
ISAAC
2005
Springer
131views Algorithms» more  ISAAC 2005»
14 years 1 months ago
Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends
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...
Xiao Zhou, Takao Nishizeki
COLOGNETWENTE
2008
13 years 9 months ago
Special Cases of Online Parallel Job Scheduling
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, ...
Johann Hurink, Jacob Jan Paulus
ASAP
2006
IEEE
169views Hardware» more  ASAP 2006»
14 years 2 months ago
A Design Methodology for Hardware Acceleration of Adaptive Filter Algorithms in Image Processing
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...
Hritam Dutta, Frank Hannig, Jürgen Teich, Ben...
CCGRID
2007
IEEE
14 years 2 months ago
A Simulation Study of Data Partitioning Algorithms for Multiple Clusters
Abstract— Recently we proposed algorithms for concurrent execution on multiple clusters [9]. In this case, data partitioning is done at two levels; first, the data is distribute...
Chen Yu, Dan C. Marinescu, Howard Jay Siegel, John...
JPDC
2006
134views more  JPDC 2006»
13 years 8 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong