6105 search results - page 392 / 1221 » A Parallel Algorithm for Bound-Smoothing |
169
click to vote
EUROPAR
2009
Springer
16 years 1 months ago
2009
Springer
The availability of large-scale computing platforms comprised of tens of thousands of multicore processors motivates the need for the next generation of highly scalable sparse line...
164
click to vote
IPPS
2006
IEEE
16 years 25 days ago
2006
IEEE
The research interest in sensor nets is still growing because they simplify data acquisition in many applications. If hardware resources are very sparse, routing algorithms cannot...
136
click to vote
FPGA
2003
ACM
16 years 1 days ago
2003
ACM
Placement and routing are the most time-consuming processes in automatically synthesizing and configuring circuits for field-programmable gate arrays (FPGAs). In this paper, we ...
177
click to vote
IPPS
2002
IEEE
15 years 11 months ago
2002
IEEE
This paper presents a hierarchical parallel MPEG-2 decoder for playing ultra-high-resolution videos on PC cluster based tiled display systems. To maximize parallelism while minimi...
181
click to vote
IEEEPACT
2000
IEEE
15 years 11 months ago
2000
IEEE
Multimedia instruction set extensions have become a prominent feature in desktop microprocessor platforms, promising superior performance on a wide range of floating-point and int...