Sciweavers

573 search results - page 34 / 115
» Parallel Algorithms for Dandelion-Like Codes
Sort
View
TOG
2012
230views Communications» more  TOG 2012»
13 years 11 days ago
Decoupling algorithms from schedules for easy optimization of image processing pipelines
Using existing programming tools, writing high-performance image processing code requires sacrificing readability, portability, and modularity. We argue that this is a consequenc...
Jonathan Ragan-Kelley, Andrew Adams, Sylvain Paris...
BMCBI
2010
132views more  BMCBI 2010»
14 years 10 months ago
Data structures and compression algorithms for high-throughput sequencing technologies
Background: High-throughput sequencing (HTS) technologies play important roles in the life sciences by allowing the rapid parallel sequencing of very large numbers of relatively s...
Kenny Daily, Paul Rigor, Scott Christley, Xiaohui ...
IPPS
2007
IEEE
15 years 4 months ago
Scheduling Issues in Optimistic Parallelization
Irregular applications, which rely on pointer-based data structures, are often difficult to parallelize. The inputdependent nature of their execution means that traditional paral...
Milind Kulkarni, Keshav Pingali
VLSID
2006
IEEE
158views VLSI» more  VLSID 2006»
15 years 4 months ago
Programmable LDPC Decoder Based on the Bubble-Sort Algorithm
Low density parity check (LDPC) codes are one of the most powerful error correcting codes known. Recent research have pointed out their potential for a low cost, low latency hardw...
Rohit Singhal, Gwan S. Choi, Rabi N. Mahapatra
ECOOPW
1998
Springer
15 years 2 months ago
The Matrix Template Library: A Unifying Framework for Numerical Linear Algebra
Abstract. We present a uni ed approach for expressing high performance numerical linear algebra routines for a class of dense and sparse matrix formats and shapes. As with the Stan...
Jeremy G. Siek, Andrew Lumsdaine