6105 search results - page 307 / 1221 » A Parallel Algorithm for Bound-Smoothing |
169
click to vote
EUROPAR
2009
Springer
16 years 1 months ago
2009
Springer
With the increasing use of large image and video archives and high-resolution multimedia data streams in many of today’s research and application areas, there is a growing need f...
167
click to vote
ICPP
2007
IEEE
16 years 1 months ago
2007
IEEE
High performance clusters have been widely used to provide amazing computing capability for both commercial and scientific applications. However, huge power consumption has preven...
187
click to vote
SPAA
2005
ACM
16 years 7 days ago
2005
ACM
We study the problem of asymptotically reducing the runtime of serial computations with circuits of polynomial size. We give an algorithmic size-depth tradeoff for parallelizing ...
180
click to vote
SC
2003
ACM
15 years 12 months ago
2003
ACM
The emergence of grid and a new class of data-driven applications is making a new form of parallelism desirable, which we refer to as coarse-grained pipelined parallelism. This pa...
208
click to vote
IPPS
2002
IEEE
15 years 11 months ago
2002
IEEE
Expressed sequence tags, abbreviated ESTs, are DNA fragments experimentally derived from expressed portions of genes. Clustering of ESTs is essential for gene recognition and unde...