Sciweavers

75 search results - page 9 / 15
» Message passing algorithms and improved LP decoding
Sort
View
CODES
2005
IEEE
13 years 9 months ago
Hardware/software partitioning of software binaries: a case study of H.264 decode
We describe results of a case study whose intent was to determine whether new techniques for hardware/software partitioning of an application’s binary are competitive with parti...
Greg Stitt, Frank Vahid, Gordon McGregor, Brian Ei...
TCOM
2008
75views more  TCOM 2008»
13 years 7 months ago
Fast performance estimation of block codes
Importance sampling is used in this paper to address the classical yet important problem of performance estimation of block codes. Simulation distributions that comprise discretean...
Rajan Srinivasan, Nuo Wang
CSB
2005
IEEE
115views Bioinformatics» more  CSB 2005»
14 years 1 months ago
A New Clustering Strategy with Stochastic Merging and Removing Based on Kernel Functions
With hierarchical clustering methods, divisions or fusions, once made, are irrevocable. As a result, when two elements in a bottom-up algorithm are assigned to one cluster, they c...
Huimin Geng, Hesham H. Ali
DC
2010
13 years 7 months ago
Distributed algorithms for ultrasparse spanners and linear size skeletons
We present efficient algorithms for computing very sparse low distortion spanners in distributed networks and prove some non-trivial lower bounds on the tradeoff between time, spar...
Seth Pettie
GCC
2007
Springer
14 years 1 months ago
Improving the Performance of MPI Applications over Computational Grid
The Message Passing Interface (MPI) is a standard in parallel computing, and can also be used as a highperformance programming model for Grid application development. How to execu...
Bo Song, Guangwen Yang, Qiming Fang