716 search results - page 49 / 144 » Algorithmic Issues in Coding Theory |
84
Voted
ESA
2010
Springer
15 years 3 months ago
2010
Springer
abstract appeared in Proc. 24th Annual Symposium of Computational Geometry (SoCG), 2008, pp. 338-345. S. Shannigrahi and S. P. Pal, "Efficient Prufer-like Coding and Counting ...
135
click to vote
EWSN
2010
Springer
15 years 7 months ago
2010
Springer
One unfortunate consequence of the success story of wireless sensor networks (WSNs) in separate research communities is an evergrowing gap between theory and practice. Even though ...
142
click to vote
STOC
2009
ACM
16 years 3 months ago
2009
ACM
Linear programming decoding for low-density parity check codes (and related domains such as compressed sensing) has received increased attention over recent years because of its p...
116
click to vote
SIAMSC
2010
15 years 26 days ago
2010
We propose a fast algorithm for solving the ℓ1-regularized minimization problem minx∈Rn µ x 1 + Ax − b 2 2 for recovering sparse solutions to an undetermined system of linea...
129
Voted
ISSTA
2009
ACM
15 years 9 months ago
2009
ACM
Code coverage is a common aid in the testing process. It is generally used for marking the source code segments that were executed and, more importantly, those that were not execu...