437 search results - page 17 / 88 » Randomized Lattice Decoding |
APPROX
2005
Springer
15 years 6 months ago
2005
Springer
EMNLP
2007
15 years 2 months ago
2007
FOCS
1999
IEEE
15 years 5 months ago
1999
IEEE
We show that the minimum distance of a linear code is not approximable to within any constant factor in random polynomial time (RP), unless nondeterministic polynomial time (NP) eq...
GLOBECOM
2008
IEEE
15 years 1 months ago
2008
IEEE
The complexity of sphere decoding (SD) has been widely studied due to the importance of this algorithm in obtaining the optimal Maximum Likelihood (ML) performance with lower compl...
103
click to vote
ICASSP
2008
IEEE
15 years 7 months ago
2008
IEEE
Distributed coding of correlated grayscale stereo images is effectively addressed by a recently proposed codec that learns block-wise disparity at the decoder. Based on the Slepia...