716 search results - page 46 / 144 » Algorithmic Issues in Coding Theory |
133
click to vote
PPOPP
2005
ACM
15 years 8 months ago
2005
ACM
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...
115
click to vote
ISCIS
2003
Springer
15 years 7 months ago
2003
Springer
This paper presents a postprocessing technique based on the theory of projections onto convex sets (POCS) to reduce the blocking artifacts in low bit rate BDCT-coded images. In the...
123
click to vote
MM
2004
ACM
15 years 8 months ago
2004
ACM
A novel solution to the reliable multicast problem is the “digital fountain” approach, in which data is encoded with an erasure protection code before transmission, and receiv...
115
click to vote
CSC
2008
15 years 3 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
104
click to vote
SODA
2008
ACM
15 years 3 months ago
2008
ACM
In this paper, we study an online make-to-order variant of the classical joint replenishment problem (JRP) that has been studied extensively over the years and plays a fundamental...