6105 search results - page 199 / 1221 » A Parallel Algorithm for Bound-Smoothing |
218
click to vote
ASAP
2006
IEEE
16 years 13 days 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...
161
click to vote
CCGRID
2007
IEEE
16 years 21 days ago
2007
IEEE
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...
158
click to vote
JPDC
2006
15 years 6 months ago
2006
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
150
click to vote
IPPS
2010
IEEE
15 years 3 months ago
2010
IEEE
This paper focuses on parallelization of the classic static timing analysis (STA) algorithm for verifying timing characteristics of digital integrated circuits. Given ever-increasi...
193
click to vote
IPPS
1999
IEEE
15 years 10 months ago
1999
IEEE
We investigate the average-case speed and scalability of parallel algorithms executing on multiprocessors. Our performance metrics are average-speed and isospeed scalability. By m...