Sciweavers

716 search results - page 7 / 144
» Algorithmic Issues in Coding Theory
Sort
View
IPPS
2007
IEEE
14 years 1 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
AAECC
2009
Springer
140views Algorithms» more  AAECC 2009»
13 years 7 months ago
Interesting Examples on Maximal Irreducible Goppa Codes
In this paper a full categorization of irreducible classical Goppa codes of degree 4 and length 9 is given. It is an interesting example in the context of find the number of permut...
Marta Giorgetti
PVM
2010
Springer
13 years 5 months ago
Toward Performance Models of MPI Implementations for Understanding Application Scaling Issues
Abstract. Designing and tuning parallel applications with MPI, particularly at large scale, requires understanding the performance implications of different choices of algorithms ...
Torsten Hoefler, William Gropp, Rajeev Thakur, Jes...
SIGSOFT
2008
ACM
14 years 7 months ago
Semi-automating small-scale source code reuse via structural correspondence
Developers perform small-scale reuse tasks to save time and to increase the quality of their code, but due to their small scale, the costs of such tasks can quickly outweigh their...
Rylan Cottrell, Robert J. Walker, Jörg Denzin...
FTTCS
2006
106views more  FTTCS 2006»
13 years 6 months ago
Algorithmic Results in List Decoding
Error-correcting codes are used to cope with the corruption of data by noise during communication or storage. A code uses an encoding procedure that judiciously introduces redunda...
Venkatesan Guruswami