Sciweavers

437 search results - page 11 / 88
» Randomized Lattice Decoding
Sort
View
CORR
2010
Springer
162views Education» more  CORR 2010»
15 years 4 months ago
Random sampling of lattice paths with constraints, via transportation
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...
Lucas Gerin
DCC
2007
IEEE
16 years 3 months ago
Image Coding on Quincunx Lattice with Adaptive Lifting and Interpolation
Considering that quincunx lattice is a more efficient spatial sampling scheme than square lattice, we investigate a new approach of image coding for quincunx sample arrangement. T...
Xiangjun Zhang, Xiaolin Wu, Feng Wu
NIPS
2008
15 years 5 months ago
Interpreting the neural code with Formal Concept Analysis
We propose a novel application of Formal Concept Analysis (FCA) to neural decoding: instead of just trying to figure out which stimulus was presented, we demonstrate how to explor...
Dominik Endres, Peter Földiák
STOC
2010
ACM
257views Algorithms» more  STOC 2010»
16 years 1 months ago
Local List-Decoding and Testing of Random Linear Codes from High-Error
Swastik Kopparty and Shubhangi Saraf
CORR
2007
Springer
138views Education» more  CORR 2007»
15 years 4 months ago
Algebraic Distributed Space-Time Codes with Low ML Decoding Complexity
— ”Extended Clifford algebras” are introduced as a means to obtain low ML decoding complexity space-time block codes. Using left regular matrix representations of two speci...
G. Susinder Rajan, B. Sundar Rajan